|CS 321 Spring 2013 > Lecture Notes for Friday, February 22, 2013|
See the February 20 lecture notes.
All processes want a large address space, and they want it to be fast. This being expensive, we go with second best: a memory hierarchy. High in the hierarchy we have small, fast, very temporary space. Low in the hierarchy we have large, slow, long-term storage. We try to keep data that is being used high in the hierarchy.
A modern OS provides a memory abstraction, so that the hierarchy can be used in a transparent manner. We will look at three possibilities.