A simple java application that will simulate the Page Replace Algorithms, it automatically computes the number of Page Hits and Page Faults. The application can provide random data source for the user to play with, or the user can input custom data for computation.
Supported Algorithms:
- FIFO Counter
- FIFO Stack
- LRU Counter
- LRU Stack
- OPT Counter
Operating Systems and Concepts was one of my subjects in college. One part of the project is studying about computer memory, and how it is being used. We were assigned with my group mate Lyka to create a project that will simulate the Page Replacement Alogorithm.
In a computer operating system that uses paging for virtual memory management, page replacement algorithms decide which memory pages to page out, sometimes called swap out, or write to disk, when a page of memory needs to be allocated. Page replacement happens when a requested page is not in memory (page fault) and a free page cannot be used to satisfy the allocation, either because there are none, or because the number of free pages is lower than some threshold. Wikipedia.
This project is now published under MIT Open Source License.
Preview
You can download a copy of the application here
java -jar Memory_Algorithms.jar2017
Cheers,
Melvin Perello