Implementing some pieces of a memory paging system simulator framework, and you will be implementing a Clock page replacement algorithm. The simulator will allow you to take a stream of page references, like we have done by had in our written assignments and in class, and simulate a physical memory of some number of frames, where placement and replacement decisions are made and the content of the physical memory frames will change in response to the stream of page references being simulated.
Questions
What are the basic steps an OS needs to perform in order to manage a paging memory system and make placement and replacement decisions?
What are the similarities in implementation between different page replacement algorithms? What are their differences?
What information does a page replacement scheme need to keep track of to make a page replacement decision?
How does the clock page replacement scheme work? How is it implemented?
How does a clock scheme perform compared to a FIFO scheme?