Due: In class or via email, Monday May 28, 10:20 A.M.
1. Text, page 331, Question 9.5
2. Text, page 333, Question 9.10
3. Consider the following sequence of virtual memory references
generated by a single process in a pure paging system:
10, 11, 104, 170, 73, 309, 185, 245, 246, 434, 458, 364
a) Assuming a page size of 100 words, what is the reference string corresponding to these memory references?
b) Determine the number of page faults under each of the following page
replacement strategies, assuming that two page frames are available to
the process:
i) FIFO
ii) Second Chance
iii) LRU
4. Consider the reference string
1 2 3 4 5 2 3 4 3 2 4 4 2 4 4 4
Assuming the working set strategy, determine the minimum window size such that the string generates at most 5 page faults. Show which pages are in the working set (and, thus, in memory) at each reference.