CSCI 6307 Foundation of Systems – Exercise (4) Xiang Lian The University of Texas – Pan American Edinburg, TX

Exercise Consider a swapping system in which memory consists of the following hole sizes in memory order: 600, 500, 1000, 503, 400, 1050, and 1600 bytes. Which block will be selected for successive requests of: – 500, 503, 100, 1003 using first-fit, best-fit, worst-fit, or next-fit policy. 2

Exercise Consider decimal virtual addresses – – – Compute the virtual page numbers and offsets with page size 4KB 3

Exercise Suppose R= 3, 2, 4, 3, 4, 2, 2, 3, 4, 5, 6, 7, 7, 6, 5, 4, 5, 6, 7, 2, 1 is a page reference stream. Given a page frame allocation of 3, and assuming the primary memory is initially unloaded, how many page faults will the given reference stream incur under: FIFO Belady’s optimal algorithm LRU 4

FIFO

Belady’s Algorithm

LRU