Please enable JavaScript.

Coggle requires JavaScript to display documents.

O.S (記憶體管理 (Contigeous Memory Management (Worst Fit, First Fit, Best Fit,…

- - - - loader決定
    - - OS決定
    - - compiler 決定
  - - - Page Memory Management
        
        支援 memery sharing, memery protection
        
        支援 dynamic loading , linking, virtual memery
        
        no external fragment
        
        long memery acess time
        
        internal fragment
        
        need HW support (page table)
        
        Memory
        
        PTBR
        
        PTLR
        
        rigister
        
        TLB
        
        Page Tabe過大issue
        
        Hashing Page Table
        
        Inverted Page Table
        
        Hierachical Paging
      - 提供多套base/limit register
      - Compaction
        
        不易制定 optimal compaction policy
        
        必須Dinamic binding支援
- - - - Code Section
      - Data Section
  - - - waiting time
      - turnaround time
      - throughput
      - response time
      - CPU Utilization
    - - SJF
      - SRTF(SRJF,SRTN) -- Short Remaining Time First
      - FIFO (FCFS)
      - Priority
        
        Preemptive
        
        NonPreemptive
      - R.R
      - Multilevel Queue
      - Multilevel Feedback Queue
    - - Short-term(Process Scheduler, CPU Scheduler)
      - Long-term
      - Midium-term
    - - Real-time 排班考量
        
        Soft Real-time
        
        preemption point
        
        允許kernel隨時可以被preempt
        
        Priority Inversion
        
        Priority Inheritance
        
        Hard Real-time
        
        EDF
        
        Rate-monotonic
        
        Schedulable 公式
  - - - State
        
        Stalling
        
        Unix
        
        恐龍版
      - Transition
  - - - Process Value
      - Process Count
  - - - change mode to user mode
      - jump to execute entry of that process
      - context switch
- - - - Banker's Algo
        
        https://zh.wikipedia.org/wiki/%E9%93%B6%E8%A1%8C%E5%AE%B6%E7%AE%97%E6%B3%95
    - - Deadlock Detection Algo
      - Recovery 作法
    - - Circular waiting
        
        Resource Ordering
      - Mutual exclusion
      - No preemptive
      - Hold and Wait
  - - - 有cycle >> 不一定 deadlock
      - 有cycle且每個資源 single instance >> deadlock
      - 無cycle >> no deadlock
- - - - Disable Interrupt
        
        single CPU
      - Critical Section Design(Busy waiting , spin lock)
        
        基本認知
        
        3個criteria
        
        Progress
        
        Bounded Waiting
        
        Mutual exclusion
        
        c.s design 架構
        
        高階
        
        Monitor(高階資料結構)
        
        組成
        
        a set of procedure區
        
        初始區
        
        共享變數宣告區
        
        中階
        
        Semaphore
        
        Producer-and-Consumer
        
        Unbounded Buffer
        
        Bounded Buffer
        
        Reader-Writer Problem
        
        First Reader-Writer
        
        Second Reader-Writer
        
        The sleeping barber
        
        The Dining Philosophy Problem
        
        分類
        
        值域
        
        2 more items...
        
        Busy-waiting
        
        2 more items...
        
        基礎
        
        Software solution
        
        2個 process
        
        algo1 (權杖)
        
        2 more items...
        
        algo2
        
        1 more item...
        
        Peterson's solution
        
        n個 process
        
        Bakery's algo
        
        Hardware Instruction support
        
        Test-and-Set
        
        SWAP 指令
- - - - File
      - Device
      - Process
      - Information Maintainance
      - Communication
      - Protecion(Unix like)
    - - memory
      - stack
      - register
  - - - JVM
      - VM ware
      - Para-virtual Machine
      - simulation
- - - - page replacement
        
        影響page fault ration因素
        
        page size 之影響
        
        page replacement algo
        
        OPT
        
        no belady anomaly (stack Property)
        
        LRU
        
        no belady anomaly (stack Property)
        
        counter
        
        stack
        
        FIFO
        
        belady anomaly
        
        LRU 近似法則
        
        second chance
        
        可能belady anomaly
        
        enhanced second chance
        
        additional reference bit
        
        LFU與MFU
        
        Page Buffering Alog
        
        page replacement
        
        local replacement
        
        global replacement
        
        thrashing
        
        3 more items...
        
        Program structure 之影響
        
        frame數分配多少之多寡
        
        dirty bit
      - copy-on-write
        
        fork without COW
        
        fork with COW
        
        vfork with COW
- - - - 好處
      - 類型
        
        ASMP
        
        SMP
      - 溝通方式
        
        share memory
      - feature
    - - 好處
      - 溝通方式
        
        message Passing
      - feature
    - - Timesharing Sys
        
        採spooling
    - - Hard
      - Soft
- - - - user mode
      - kernel mode
        
        priviledge instruction
- - - - Linkedlist
      - Grouping
      - Bit Vector
      - Counting
    - - FCFS
      - SSTF
      - SCAN
      - C-SCAN
      - LOOK
      - C-LOOK
    - - linked
        
        File Allocation Table
      - Index
        
        Unix I-node
        
        https://www.javatpoint.com/os-inode
        
        Index block不足解決方法
      - contagious
    - - 2
        
        mirroring
      - 3
        
        bit-level stripping + parity check
      - 1
        
        mirroring
      - 4
        
        Block-level stripping + parity
      - 0
        
        stripping
      - 5
        
        Block-level stripping + parity
      - 6
        
        Reed-soloman 防止多部disk bad
    - - Spare Sector
      - Sector slipping
      - Mark Bad Sector