Write a program that simulates a toy paging system that uses the WSClock algorithm. The system is a toy in that we will assume there are no write references (not very realistic), and process termination and creation are ignored (eternal life). The inputs will be: The reclamation age threshhold The clock interrupt interval expressed as number of memory references A file containing the sequence of page references Describe the basic data structures and algorithms in your implementation. Show that your simulation behaves as expected for a simple (but nontrivial) input example. Plot the number of page faults and working set size per 1000 memory references. Explain what is needed to extend the program to handle a page reference stream that also includes writes.
Write a program that simulates a toy paging system that uses the WSClock
Trending now
This is a popular solution!
Step by step
Solved in 2 steps