Simulation of Virtual Memory Paging Algorithms
-
Updated
Oct 10, 2020 - JavaScript
Simulation of Virtual Memory Paging Algorithms
Asynchronous cache that implements Least Recently Used (LRU) - Clock - Second Chance algorithm with O(1) hit O(1) miss complexity. This Async cache hides latency of cache-misses behind each other and behind cache-hits.
A straightforward implementation of a least recently used (LRU) cache using JavaScript's Map 🗺️
"Least Recently Used" (LRU) cache compatible to ES6 Map
Add a description, image, and links to the least-recently-used topic page so that developers can more easily learn about it.
To associate your repository with the least-recently-used topic, visit your repo's landing page and select "manage topics."