https://github.com/yourboyrory/page-replacement-algorithms

This was a project for my COMP-3340 OS course
https://github.com/yourboyrory/page-replacement-algorithms

Last synced: 21 days ago
JSON representation

This was a project for my COMP-3340 OS course

• Host: GitHub
• URL: https://github.com/yourboyrory/page-replacement-algorithms
• Owner: YourBoyRory
• Created: 2024-11-20T21:32:07.000Z (about 2 months ago)
• Default Branch: main
• Last Pushed: 2024-11-20T21:33:19.000Z (about 2 months ago)
• Last Synced: 2024-11-20T22:46:17.810Z (about 2 months ago)
• Size: 1.95 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# **Bonus Assignment \- Page Replacement**

Given it is completed correctly, it will be valued at \+15 points on a test score

In this assignment, you are to demonstrate the three different page replacement algorithms taught in class:  FIFO, Optimal, LRU.  

In order to frustrate AI, you must use the following struct to hold the current values of the frames:  

struct Workspace{  

	int frame1;  

	int frame2;  

	int frame3;  

};

* This project may be completed in Windows or Linux\!  But it still must be written in C++.  

* Use a file to input the reference string  

* Use the same reference string from chapter 10, slide 37 for testing.  I reserve the right to use a similar string of possibly different length for testing.  Please design your file reading to work for a single number per line  

* The output is the both the current values in the frames given the input, and finally the total number of page faults

Output:

FIFO  

7|7  

0|7 0  

1|7 0 1  

2|2 0 1  

0|2 0 1  

3|2 3 1  

etc…

x Faults\!

Optimal  

7|7  

0|7 0  

1|7 0 1  

Etc…

X Faults\!

LRU  

Etc …