Hub: engineering

Part of the series

Demand Paging

  1. Basic concepts
  2. Performance of demand paging

Copy-On-Write

Page Replacement

  1. Basic Page Replacement
  2. First In First Out Page Replacement
  3. Optimal Page Replacement
  4. Least Recently Used Page Replacement
  5. LRU Approximation Page Replacement
  6. Counting Based Page Replacement
    1. Additional-Reference-Bits Algorithm
    2. Second-chance algorithm
    3. Enhanced second-chance algorithm
  7. Page-Buffering algorithms
  8. Applications and Page Replacement

Allocation of frames

  1. minimum number of frames
  2. allocation algorithms
  3. global versus local allocation

Thrashing

  1. causes
  2. working-set model
  3. page-fault frequency

Memory-mapped Files

  1. Basic mechanism
  2. Shared memory in the win32 API
  3. Memory-mapped I/O

Allocating Kernel Memory

  1. Buddy system
  2. Slab allocation

Other considerations

  1. Prepaging
  2. Page size
  3. TLB reach
  4. Inverted page table
  5. Program structure
  6. I/O interlock

Operating System Examples

  1. Windows XP
  2. Solaris