Javier Gonzalez

CST 334 - Operating Systems

30 March 2021

Lab 4 Write-up

Lab 4 demonstrates a program that simulates the FIFO page replacement algorithm.
The program is to accept at least one numeric command-line parameter, which it will
use as the number of available page frames. The program displays the number of page
faults and the total number of pages read. Below is a graph representing misses vs
cache sizes from 10 to 1,500:

The graph also shows that the cache hit rate percentage improved as the cache size
increased but when it approaches a cache size of 1,000 it plateaus. After a cache size
of 1,000, the page faults stay steady at 999. This may be due to the fact that
accesses.txt has at least 1,000 (0 - 999) unique page numbers and after a cache size of
1,000, there will be no more misses-only hits!