The Community for Technology Leaders
Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (2002)
Charlottesville, Virginia
Sept. 22, 2002 to Sept. 25, 2002
ISSN: 1089-795X
ISBN: 0-7695-1620-3
pp: 199
Charles C. Weems , University of Massachusetts at Amherst
Kathryn S. McKinley , University of Texas at Austin
Arnold L. Rosenberg , University of Massachusetts at Amherst
Zhenlin Wang , University of Massachusetts at Amherst
ABSTRACT
Memory performance is increasingly determining microprocessor performance and technology trends are exacerbating this problem. Most architectures use set-associative caches with LRU replacement policies to combine fast access with relatively low miss rates. To improve replacement decisions in set-associative caches, we develop a new set of compiler algorithms that predict which data will and will not be reused and provide these hints to the architecture. We prove that the hints either match or improve hit rates over LRU. We describe a practical one-bit cache-line tag implementation of our algorithm, called evict-me. On a cache replacement, the architecture will replace a line for which the evict-me bit is set, or if none is set, it will use the LRU bits. We implement our compiler analysis and its output in the Scale compiler. On a variety of scientific programs, using the evict-me algorithm in both the level 1 and 2 caches improves simulated cycle times by up to 34% over the LRU policy by increasing hit rates. In addition, a combination of simple hardware prefetching and evict-me works together to further improve performance.
INDEX TERMS
null
CITATION
Charles C. Weems, Kathryn S. McKinley, Arnold L. Rosenberg, Zhenlin Wang, "Using the Compiler to Improve Cache Replacement Decisions", Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, vol. 00, no. , pp. 199, 2002, doi:10.1109/PACT.2002.1106018
92 ms
(Ver 3.3 (11022016))