Simulation of the following page replacement algorithms:
This project was made as an assessment for a Operating Systems university course.
Simple Build & Run
cat ./sample-input.txt | ./gradlew --quiet :app:run
cat ./sample-input.txt | gradlew.bat --quiet :app:run
See the sample input file; this is a line-by-line description:
- Ordered page requests separated with commas
- Memory frames’ quantity
Number of page faults (PF)
Memory frames’ contents after each page request (trace)
For the clock algorithm, the trace contains use-bit (*) and pointer (->) indicators.