CS 111 Fall 2010 Lecture 15 Notes

Notes by Charles Graves and Max Vujovic on Professor Paul R. Eggert's 15th lecture of fall 2010 presented on November 18, 2010.

Virtual Memory Policy

Locality of reference

Temporal Locality

Spatial Locality

Reference Strings

FIFO Page Replacement Policy

Belody's Anomaly

Optimal Page Replacement Policy

Least Recently Used

Demand Paging

Dirty Bit

Classic Virtual Memory Trick: Using the SIGSEGV Signal to Grow the Heap

Classic Virtual Memory Trick: Using vfork instead of fork.

Virtual Machine Efficiency and File System Efficiency

FCFS Disk Scheduling Policy

Shortest Seek Time First (SSTF) Scheduling Policy

The Elevator Algorithm

The Circular Elevator Algorithm

Anticipatory Scheduling

Robustness Constraints for File Systems

Valid HTML 4.01 Strict