Simulators
Page replacement simulator
Enter a reference string and the number of frames, then step through the references: one column per reference and one row per frame, with each hit, each fault and the page every algorithm throws out.
The simulator
Page replacement simulator: how to use it
Compare FIFO, LRU and the Optimal algorithm on the same string, and try more frames with FIFO to see Belady's anomaly.
Lessons that use it
- Virtual memory and page replacement (Operating Systems)Demand paging and what happens on a page fault, its cost, the FIFO, Optimal and LRU replacement algorithms, Belady's anomaly, and thrashing.
See also
- CPU scheduling simulator
- Banker's algorithm simulator
- Disk scheduling simulator
- Race condition simulator
- Truth table maker
- Gradient descent simulator
- K-means clustering simulator
- Subnet calculator
- Sliding window simulator
- TCP congestion control simulator
- Karnaugh map solver
- Flip-flop simulator
- Ripple-carry adder
- Cache simulator
- 5-stage pipeline simulator