EMISSARY: Enhanced Miss Awareness Replacement Policy for L2 Instruction Caching
Authors:
- Nayana Prasad NagendraNNNayana Prasad Nagendra
- Bhargav Reddy GodalaBGBhargav Reddy Godala
- Ishita ChaturvediICIshita Chaturvedi
- Atmn PatelAPAtmn Patel
- Svilen KanevSKSvilen Kanev
- Tipp MoseleyTMTipp Moseley
- Jared StarkJSJared Stark
- Gilles A. PokamGPGilles A. Pokam
- Simone CampanoniSCSimone Campanoni
- David I. AugustDADavid I. August
Open Access
- 17 June 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Abstract
For decades, architects have designed cache replacement policies to reduce cache misses. Since not all cache misses affect processor performance equally, researchers have also proposed cache replacement policies focused on reducing the total miss cost rather than the total miss count. However, all prior cost-aware replacement policies have been proposed specifically for data caching and are either inappropriate or unnecessarily complex for instruction caching. This paper presents EMISSARY, the first cost-aware cache replacement family of policies specifically designed for instruction caching. Observing that modern architectures entirely tolerate many instruction cache misses, EMISSARY resists evicting those cache lines whose misses cause costly decode starvations. In the context of a modern processor with fetch-directed instruction prefetching and other aggressive front-end features, EMISSARY applied to L2 cache instructions delivers an impressive 3.24% geomean speedup (up to 23.7%) and a geomean energy savings of 2.1% (up to 17.7%) when evaluated on widely used server applications with large code footprints. This speedup is 21.6% of the total speedup obtained by an unrealizable L2 cache with a zero-cycle miss latency for all capacity and conflict instruction misses.Keywords
Funding Information
- U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research (DE-SC0022138, DE-SC0022268)
- National Science Foundation (CCF-2107257, CCF-2118708, CCF-2107042, CCF-1908488)
This publication has 37 references indexed in Scilit:
- A Top-Down method for performance analysis and counters architecture2014
- OLTP-BenchProceedings of the VLDB Endowment, 2013
- LACS: A Locality-Aware Cost-Sensitive Cache Replacement AlgorithmIEEE Transactions on Computers, 2013
- The gem5 simulatorACM SIGARCH Computer Architecture News, 2011
- Adaptive insertion policies for high performance cachingACM SIGARCH Computer Architecture News, 2007
- The DaCapo benchmarks2006
- A large, fast instruction window for tolerating cache missesACM SIGARCH Computer Architecture News, 2002
- Optimizations enabled by a decoupled front-end architectureIEEE Transactions on Computers, 2001
- A scalable front-end architecture for fast instruction deliveryACM SIGARCH Computer Architecture News, 1999
- Benchmark synthesis using the LRU cache hit functionIEEE Transactions on Computers, 1988