Inter-reference gap distribution replacement: an improved replacement algorithm for set-associative caches

We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to each memory-block, and on a replacement request it selects the memory-block with the smallest weight for eviction. The time difference between successive references of a memory-block is called its Inter-Reference Gap (IRG). IGDR estimates the ideal weight of a memory-block by using the reciprocal of its IRG. To estimate this reciprocal, it is assumed that each memory-block has its own probability distribution of IRGs; from which IGDR calculates the expected value of the reciprocal of the IRG to use as the weight of the memory-block. For implementation, IGDR does not have the probability distribution; instead it records the IRG distribution statistics at run-time. IGDR classifies memoryblocks and records statistics for each class. It is shown that the IRG distributions of memory-blocks correlate their referen...

• Type: Conference
• Year: 2004
• Where: ICS
• Authors: Masamichi Takagi, Kei Hiraki
• Keywords: ICS 2004, Irg Distributions, Probability Distribution, Replacement Algorithm, Theoretical Computer Science