Please enable JavaScript.

Coggle requires JavaScript to display documents.

OS (Disk Management (زمانبندی بازوی دیسک (FCFS, SSTF, Scan/Look, C-Scan),…

- - - - 30000/rpm
  - - - فضای خالی برای فعالیت جدید
      - تعیین مقدار فضای مورد نیاز یک فایل
    - - عدم حمایت از دستیابی مستقیم
      - اتلاف فضا
      - عدم قابلیت اطمینان سیستم
- - - - Dynamic
        
        [Al]Locating Methode
        
        First
        
        Next
        
        Best
        
        Worst
      - Static
    - - Segmentation
        
        if(d < limit) {d + Base;}
        
        Demand
      - Paging
        
        Demand
        
        Hybrid
  - - - Page Changing Methode
        
        LRU
        
        NRU
        
        Min (RM)
        
        FIFO
        
        First
        
        2nd Chance
        
        if(R == 1)
        {R--
        go to end}
        
        Clock
        
        in 2PL
        if(R == 1)
        {R--}
        
        Optimal
        
        Max Distance R
        
        Before
        
        After
        
        Page Fault
  - - - T(Translation)
        
        H*T(TLB)
        
        1-H * T(TLB)+T(Mem)
        
        T(TLB) + (1-H)*T(Mem)
        
        T(TLB)
        
        1-H * T(Mem) + P T(Disk)
      - T(Mem)
      - P*T(Disk)
- - - - Decker
        
        1
        
        Progress
        
        Link Title
        
        Turn
        
        2
        
        Mutual Exclusion
        
        Link Title
        
        Bounded Waiting (Hungry)
        
        Flag 0,1
        
        3
        
        Bounded Waiting (DeadLock)
        
        4
        
        Bounded Waiting (Hungry & LiveLock)
        
        5
        
        Link Title
        
        Turn
        
        Flag 0, 1
        
        while(turn != 0);
        
        turn = 1
        
        while(flag[1]);
        
        delay( );
        
        flag[0] = true
        
        flag[0] = false
        
        if (turn == 1)
        
        while(turn==1) do;
        
        flag[0] = true
        
        flag[0] = false
      - Peterson
        
        Link Title
        
        Turn
        
        Flag
        
        flag[0] = true
        
        turn = 0
        
        while (turn == 0 && flag[1])
        
        flag[0] = false
      - Link Title
    - - Disable Interruptions
        
        Multy CPU
      - Swap
        
        Bounded Waiting (Hungry)
      - T SL
        
        Bounded Waiting (Hungry)
    - - Semaphore (Wait & Signal)
        
        Producer & Consumer
        
        Empty
        
        Full
        
        Link Title
        
        Mutex
        
        مجبور می شود ابتدا فرایند signal دار را انجام دهد تا پس از آن از wait رد شود
        
        Link Title
        
        Link Title
        
        Mutex
        
        Eater Philosopher
        
        Link Title
        
        Link Title
        
        room
        
        fork
        
        Mutex
        
        S[n]
        
        Writer & Reader
        
        Link Title
        
        Mutex
        
        Write
        
        wait(metux)
        
        signal(metux)
        
        wait(empty)
        
        signal(full)
- - - - Mutual Exclusion
      - Circular Wait
      - Non Preemption
      - Hold & Wait
    - - 0
        
        -
      - 1
        
        ?
        
        ReSource
        
        n
        
        ?
        
        1
        
        +
      - n
        
        +
  - - - Designing
        
        (Global) Free & Get
        
        (Local) Increase Request
        
        Quantum
    - - Dont Beginning
      - Dont Response
        
        The Banker
        
        Resource/Exist
        
        Available
        
        Claim/Max
        
        Allocation
        
        Need
        
        Allocation
        
        Kill Youngest