CS 321 Spring 2013  >  Lecture Notes for Friday, February 22, 2013

CS 321 Spring 2013
Lecture Notes for Friday, February 22, 2013

Scheduling Methods (cont’d)

See the February 20 lecture notes.

Introduction to Memory Management

Basics

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.

Memory Abstractions

A modern OS provides a memory abstraction, so that the hierarchy can be used in a transparent manner. We will look at three possibilities.


CS 321 Spring 2013: Lecture Notes for Friday, February 22, 2013 / Updated: 6 May 2013 / Glenn G. Chappell / ggchappell@alaska.edu