implementation of page replacement algorithms - FIFO, OPT, LRU, approximate LRU, RAND
-
Updated
Apr 14, 2017 - Java
implementation of page replacement algorithms - FIFO, OPT, LRU, approximate LRU, RAND
Key-value least-recently-used (LRU) cache module written in Typescript with zero dependencies.
A C# reference implementation of a Least Recently Used (LRU) cache for educational purposes.
Laboratory simulations from Operating Systems. Major: Applied Computer Science. University of Science and Technology.
LRU Stands for Least Recently Used and LRU Cache help identify the least recently used items in a System.
Code produced to test different page replacement algorithms for the Operating Systems course
operating system programs and algorithms in c
A LRU cache implemented using object oriented approach
Virtual Memory simulator, with directory and table indexing and paging. Also includes replacement algorithms (Rand, FIFO, CLOCK, LRU and OPT) used by the VM
Add a description, image, and links to the lru topic page so that developers can more easily learn about it.
To associate your repository with the lru topic, visit your repo's landing page and select "manage topics."