Issue No.06 - June (1988 vol.37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2208
The performance of set associative caches is analyzed. The method used is to group the cache lines into regions according to their positions in the replacement stacks of a cache, and then to observe how the memory access of a CPU is distributed over these regions. Results from the preserved CPU traces show that the memory accesses are heavily concentrated on the most recently used (MRU) region
MRU change; performance; set associative caches; memory access; CPU; most recently used; replacement algorithms; prefetch algorithms; cache simulation; content-addressable storage; performance evaluation; storage management; virtual storage.
K. So, R.N. Rechtschaffen, "Cache Operations by MRU Change", IEEE Transactions on Computers, vol.37, no. 6, pp. 700-709, June 1988, doi:10.1109/12.2208