XE33OSA Project No. 3:
Java Simulator for Virtual Memory Page Replacement Algorithm
This project is suitable for TWO or THREE students and requires a reasonably good knowledge of
Java applets programming.
There are several basic algorithms for finding a victim memory frame when a virtual memory page
fault occurs. Among these algorithms, LRU (Least Recently Used) algorithm is preferred for its
efficiency. Unfortunately, this algorithm is very expensive in its exact form and therefore various
approximations are used. A brief description of these algorithms is available here.
Commonly used is the “second chance” (sometimes called “clock”) replacement algorithm.
An existing Java applet for animation of the page replacement algorithms is available here.
Modify this applet so that it can animate also the second chance replacement algorithm and compare
its performance with the pure LRU for several reference strings (cf. the above-mentioned description).