Outline for May 2, 2022
Reading:
text
, §18–20
Assignments:
Homework 2, due May 9
Announcements
Segmented paging
How it works
When it is used
Paged segmentation
How it works
When it is used
Virtual Memory
How it relates to physical memory
Overlyds
Dynamic loading
Demand paging
Handling page faults
Handling page faults
Effective memory access time
Dirty bit
Page replacement algorithms
Reference string
First in, first out (FIFO)
Belady’s anomaly
Optimal (OPT, MIN)
Least recently used (LRU)
Stack algorithms
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.