implementation of page replacement algorithms - FIFO, OPT, LRU, approximate LRU, RAND
-
Updated
Apr 14, 2017 - Java
8000
implementation of page replacement algorithms - FIFO, OPT, LRU, approximate LRU, RAND
A virtual memory simulator implementing demand paging and four page replacement policies (FIFO, LRU, RAND, OPT). It processes input configurations and request sequences, outputting execution time, page faults, and swap usage.
Add a description, image, and links to the rand topic page so that developers can more easily learn about it.
To associate your repository with the rand topic, visit your repo's landing page and select "manage topics."