Homework: Page Replacement Schemes, Clock Algorithm- Introduction to Operating Systems
Objectives
i. Implement a clock paging scheme by hand within a paging system simulator framework.
ii. Look at use of C++ virtual classes and virtual class functions for defining an interface/API
iii. Better understand how paging systems work, and in particular what information is needed to be tracked to make page replacement decisions.
Overview
In this homework you will be 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.
Task
i. What are the basic steps an OS needs to perform in order to manage a paging memory system and make placement and replacement decisions?
ii. What are the similarities in implementation between different page replacement algorithms? What are their differences?
iii. What information does a page replacement scheme need to keep track of to make a page replacement decision?
iv. How does the clock page replacement scheme work? How is it implemented?
v. How does a clock scheme perform compared to a FIFO scheme?
Format your homework according to the following formatting requirements:
i) The answer should be typed, using Times New Roman font (size 12), double spaced, with one-inch margins on all sides.
ii) The response also includes a cover page containing the title of the homework, the student's name, the course title, and the date. The cover page is not included in the required page length.
iii) Also include a reference page. The Citations and references must follow APA format. The reference page is not included in the required page length.
Attachment:- Introduction.rar