Outline for May 2, 2022

Reading: text, §18–20
Assignments: Homework 2, due May 9


  1. Announcements
  2. Segmented paging
    1. How it works
    2. When it is used
  3. Paged segmentation
    1. How it works
    2. When it is used
  4. Virtual Memory
    1. How it relates to physical memory
    2. Overlyds
    3. Dynamic loading
    4. Demand paging
  5. Handling page faults
    1. Handling page faults
    2. Effective memory access time
    3. Dirty bit
  6. Page replacement algorithms
    1. Reference string
    2. First in, first out (FIFO)
    3. Belady’s anomaly
    4. Optimal (OPT, MIN)
    5. Least recently used (LRU)
    6. Stack algorithms

UC Davis sigil
Matt Bishop
Office: 2209 Watershed Sciences
Phone: +1 (530) 752-8060
Email: [email protected]
ECS 150, Operating Systems
Version of May 7, 2022 at 9:19PM

You can also obtain a PDF version of this.

Valid HTML 4.01 Transitional Built with BBEdit Built on a Macintosh