A graph theoretic approach to cache-conscious placement of data for direct mapped caches

Caches were designed to amortize the cost of memory accesses by moving copies of frequently accessed data closer to the processor. Over the years the increasing gap between processor speed and memory access latency has made the cache a bottleneck for pro-gram performance. Enhancing cache performance has been instru-mental in speeding up programs. For this reason several hardware and software techniques have been proposed by researchers to opti-mize the cache for minimizing the number of misses. Among these are compile-time data placement techniques in memory which im-prove cache performance. For the purpose of this work, we concern ourselves with the problem of laying out data in memory given the sequence of accesses on a finite set of data objects such that cache-misses are minimized. The problem has been shown to be hard to solve optimally even if the sequence of data accesses is known at compile time. In this paper we show that given a direct-mapped cache, its size, and the data access sequence, it is possible to iden-tify the instances where there are no conflict misses. We describe an algorithm that can assign the data to cache for minimal number of misses if there exists a way in which conflict misses can be avoided altogether. We also describe the implementation of a heuristic for assigning data to cache for instances where the size of the cache forces conflict misses. Experiments show that our technique results in a 30 % reduction in the number of cache misses compared to the original assignment