UMUC CS 412, Sp 97, Memory management

 Silberschat and Gavin chapters 8 and 9
Tanenbaum, chapter 3

Outline


Binding (S 8.1)

Logical and physical memory (S 8.2)

Swapping (S 8.3)

Contiguous allocation (S 8.4)

Paging (8.5)

Segmentation (S 8.6, 8.7)

Virtual memory (S 9, 9.1)

Use the disk for more memory!
May be slow.

Demand paging (S 9.2)

Algorithms (S 9.3 - 9.6)

 Overallocation (S9.4):

Page replacement algorithms (S 9.5):

Frame allocation (S 9.6)

Thrashing (S 9.7)

More time paging than executing.

As multi-programming increases, at some point thrashing sets in (S Fig. 9.14, page 331)

Goal: give a process as many pages as it "needs", how many is this?

Topics (S 9.8, 9.9)


<end of page, mm.htm> last update: 2/25/97