A low-latency LRU approximation cache in C++ using CLOCK second-chance algorithm. Multi level cache too. Up to 2.5 billion lookups per second.
-
Updated
Jan 18, 2024 - C++
A low-latency LRU approximation cache in C++ using CLOCK second-chance algorithm. Multi level cache too. Up to 2.5 billion lookups per second.
Simulator for Direct, Associative, Set Associative Mapping Technique in Cache Allocation
The following program here helps in simulating how blocks from main memory can get mapped to cache based on strategies: Direct-Mapping, Fully-Associative, Set-Associative
2-level TLB Controller
A simple implementation of a Direct Mapped Cache and Set Associative Cache in C++. Supports for different sizes of the cache, block, #ways, etc.
Add a description, image, and links to the set-associative-cache topic page so that developers can more easily learn about it.
To associate your repository with the set-associative-cache topic, visit your repo's landing page and select "manage topics."