Notes: Operative Systems – Part 10

< Previous (Operative Systems – Part 9)

NOTIFICATION: These notes are published for educational purposes. Using these notes is under your own responsibility and risk. These notes are given ‘as is’. I do not take responsibilities for how you use them.

PDF Content:

  • I/O handling
  • Shareable versus dedicated devices
  • Programmed I/O
  • Interrupt-driven I/O
  • DMA I/O
  • I/O software layers
  • Device drivers
  • Disk arm scheduling algorithm
  • Elevator (SCAN) algorithm

Operative_Systems_10

 

< Previous (Operative Systems – Part 9)

Share

Notes: Operative Systems – Part 6

< Previous (Operative Systems – Part 5) | (Operative Systems – Part 7) Next >

NOTIFICATION: These notes are published for educational purposes. Using these notes is under your own responsibility and risk. These notes are given ‘as is’. I do not take responsibilities for how you use them.

PDF Content:

  • Least recently used  (LRU) page replacement algorithm
  • Not frequenty used (NFU) algorithm
  • Aging (approximation of LRU) algorithm
  • Working set
  • Current virtual time
  • Page replacement algorithm
  • Clock page replacement algorithm
  • WSClock page replacement algorithm
  • Local vs. Global replacement policies
  • Internal vs. External fragmentation
  • Page size
  • Periodic cleaning policy
  • Thrashing
  • Separation of policy and mechanism
  • Concurrency vs. parallelism
  • Critical sections

Operative_Systems_6

 

< Previous (Operative Systems – Part 5) | (Operative Systems – Part 7) Next >

Share

Notes: Operative Systems – Part 5

< Previous (Operative Systems – Part 4) | (Operative Systems – Part 6) Next >

NOTIFICATION: These notes are published for educational purposes. Using these notes is under your own responsibility and risk. These notes are given ‘as is’. I do not take responsibilities for how you use them.

PDF Content:

  • Page tables
  • Multilevel page tables
  • Page size
  • Page table management
  • Page fault time
  • Page fault handling
  • Not recently used page replacement algorithm
  • Not recently used algorithm (NRU)
  • Locking pages in memory
  • Page replacement algorithms
    • Optimal page replacement (OPR)
    • First in first out (FIFO)
    • Second change
    • Last recently used (LRU)
    • Not frequently used (NFU)
    • Assigning
    • Working set
    • Clock
    • WS clock

Operative_Systems_5

 

< Previous (Operative Systems – Part 4) | (Operative Systems – Part 6) Next >

Share

Notes: Operative Systems – Part 2

< Previous (Operative Systems – Part 1) | (Operative Systems – Part 3) Next >

NOTIFICATION: These notes are published for educational purposes. Using these notes is under your own responsibility and risk. These notes are given ‘as is’. I do not take responsibilities for how you use them.

PDF Content:

  • Dispatcher
  • Scheduling criteria
  • Optimization criteria
  • Scheduling algorithm goals
  • First-come, first-served scheduling (FCFS)
  • Shortest-job-first Scheduling (SJR)
  • Shortest Remaining Time Next (SRTF)
  • Pre-empty Shortest-job-first (PSJR)
  • CPU burst
  • Priority scheduling
  • Round Robin (RR)
  • Time quantum
  • Context switch time
  • Multilevel queue
  • Multilevel feedback queue (MFQ)
  • Real-time scheduling
  • Flow of control
  • Fair scheduling
  • Work-conserving
  • Non-work-conserving
  • Organization of Linux kernel
  • Privilege modes
  • System calls

Operative_Systems_2

 

< Previous (Operative Systems – Part 1) | (Operative Systems – Part 3) Next >

Share