The Direct-to-Data (D2D) cache
Authors:
Open Access
- 14 June 2014
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 42 (3) , 133-144
Abstract
Modern processors optimize for cache energy and performance by employing multiple levels of caching that address bandwidth, low-latency and high-capacity. A request typically traverses the cache hierarchy, level by level, until the data is found, thereby wasting time and energy in each level. In this paper, we present the Direct-to-Data (D2D) cache that locates data across the entire cache hierarchy with a single lookup. To navigate the cache hierarchy, D2D extends the TLB with per cache-line location information that indicates in which cache and way the cache line is located. This allows the D2D cache to: 1) skip levels in the hierarchy (by accessing the right cache level directly), 2) eliminate extra data array reads (by reading the right way directly), 3) avoid tag comparisons (by eliminating the tag arrays), and 4) go directly to DRAM on cache misses (by checking the TLB). This reduces the L2 latency by 40% and saves 5-17% of the total cache hierarchy energ D2D's lower L2 latency directly improves L2 sensitive applications' performance by 5-14%. More significantly, we can take advantage of the L2 latency reduction to optimize other parts of the micro-architecture. For example, we can reduce the ROB size for the L2 bound applications by 25%, or we can reduce the L1 cache size, delivering an overall 21% energy savings across all benchmarks, without hurting performance.Keywords
This publication has 12 references indexed in Scilit:
- TLC2013
- The gem5 simulatorACM SIGARCH Computer Architecture News, 2011
- McPAT2009
- Message from the Program Chairs2007
- SPEC CPU2006 benchmark descriptionsACM SIGARCH Computer Architecture News, 2006
- Managing Wire Delay in Large Chip-Multiprocessor Caches2005
- Location cache2004
- An adaptive, non-uniform cache structure for wire-delay dominated on-chip caches2002
- Two fast and high-associativity cache schemesIEEE Micro, 1997
- Don't use the page number, but a pointer to it1996