Develop a simulation program to investigate the relative effectiveness of the FIFO, LRU, and OPT page replacement strategies
in side the project.zip there are some file the you will use as input and “README” .you should read the data file “README” to know how to make the program. Also there are some data file “1p9595” and other you will use as input file.
Develop a simulation program to investigate the relative effectiveness of the FIFO, LRU, and OPT page replacement strategies. Your program should measure the number of page faults generated by each strategy.
Your simulator should read a reference string from a file. The reference string items will be of the form: , where PID is a process ID and page ref is a page of that process’ logical memory. There will be one reference per line of the file. For example, the following might be the beginning of an input file:
1 45
1 46
1 45
1 44
1 45
2 45
2 46
2 47
2 47
2 46
This reference string corresponds to Process 1 accessing its pages 45, 46, 45, 44, and 45, then Process 2 accessing its pages 45, 46, 47, 47, and 46. We will assume a pure demand paging system (i.e., no prefetching). The simulation also must allow the number of physical frames to be specified. So for example, if there are 3 or more frames available, the above reference string will cause 6 page faults for all three strategies (one for each time a new page is referenced). If there are only 2 frames available, then there would be 6 page faults for LRU and OPT, and 7 page faults for FIFO.
The input file name and the number of physical frames may be entered interactively or on the commandline. The output for this simulation is the number of page faults generated for each replacement strategy.
For the purposes of making this simulation manageable, assume a program has 2 megabytes (2048 kilobytes) of virtual memory divided into 1K pages (i.e., a program can generate page references from 0 to 2047), and there will no more than 150 processes (PIDs 0 to 149). We also will assume a global replacement strategy. That is, when a page fault occurs, the victim page can be taken from any process. We will ignore the issue of dirty pages by assuming that all victim pages have not been modified.
Assignment (40 points)
(20 points) This project is to be done individually. Each student must implement a simulation meeting the specifications above for each page replacement algorithm with a physical memory size (in frames) that can be set for each run of the program.
The simulator may be written in any language for either Linux (projects must run on csserver) or Windows (projects using any IDE available in CS Lab are acceptable). However, the instructor can provide assistance only for C/C++ projects, and maybe Java projects. Provide a makefile that will make your project if it needs to be compiled. The file names and frame number value may be provided to the simulation either as commandline arguments or interactively. Hardcoding the test file names or frame number values into the program is not acceptable.
What to Submit
Create a tarfile or zipfile containing the following:
- The well documented code source code for your project. If you are submitting a Windows project, submit the entire project folder
- A makefile to make your project, if needed
- A single document in PDF format containing(output):
1-instructions on how to build and/or run the program.
"You need a similar assignment done from scratch? Our qualified writers will help you with a guaranteed AI-free & plagiarism-free A+ quality paper, Confidentiality, Timely delivery & Livechat/phone Support.
Discount Code: CIPD30
Click ORDER NOW..
