Implements a simulation of lru cache behavior based on Mattson's classic paper[1]
It gives us an idea of what the cache hit rate would be for any cache size.
It's roughly O(number of blocks) per lookup and so is not suited for high qps collections.
If required [2] lets you simulate m different cache sizes in O(m) time per lookup.
1. "Evaluation techniques for storage hierarchies" http://www-inst.eecs.berkeley.edu/~cs266/sp10/readings/mattson70.pdf
2. "Implementing Stack Simulation for Highly-Associative Memories" http://pages.cs.wisc.edu/~markhill/papers/sigmetrics91_fully_assoc.pdf
Implements a simulation of lru cache behavior based on Mattson's classic paper[1] It gives us an idea of what the cache hit rate would be for any cache size. It's roughly O(number of blocks) per lookup and so is not suited for high qps collections. If required [2] lets you simulate m different cache sizes in O(m) time per lookup. 1. "Evaluation techniques for storage hierarchies" http://www-inst.eecs.berkeley.edu/~cs266/sp10/readings/mattson70.pdf 2. "Implementing Stack Simulation for Highly-Associative Memories" http://pages.cs.wisc.edu/~markhill/papers/sigmetrics91_fully_assoc.pdf