Algorithm Descriptions
- Random: This algorithm replaces the page in memory by random selection.
- First in First Out (FIFO): Algorithm treats the page frames allocated to a process as a circular buffer, and pages are removed in round-robin style.
- Least Recently Used (LRU): Replaces the page in memory that has not been referenced for the longest time.
- Most Frequently Used (MFU): Replaces the page in memory that has the smallest counter, in other words the page is replaced that has been accessed the least number of times.
Helpful Hints
Page Address String:Field to enter data string.
References: Total number of data entities
Hits: Number of page hits occured after the simulation
Page Faults: Number of page faults occured after the simulation
Report: Result of the simulation is displayed in the field
Radio Buttons To choose an algorithm described above
Frame Size: Dropdown of Pages available
Speed Bar: Can be used to control the speed of the simulation
Start: Button to start the simulation