PagRIP

Simulation of the following page replacement algorithms:

• Optimal
• LRU
• FIFO
• Clock

This project was made as an assessment for a Operating Systems university course.

Simple Build & Run

Linux

cat ./sample-input.txt | ./gradlew --quiet :app:run

Windows

cat ./sample-input.txt | gradlew.bat --quiet :app:run

Input Specification

See the sample input file; this is a line-by-line description:

1. Ordered page requests separated with commas
2. Memory frames' quantity

Output Specification

1. Number of page faults (PF)

2. Memory frames' contents after each page request (trace)

   For the clock algorithm, the trace contains use-bit (*) and pointer (->) indicators.