A locality-aware memory hierarchy for energy-efficient GPU architectures
Authors:
Open Access
- 7 December 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 86-98
Abstract
As GPU's compute capabilities grow, their memory hierarchy increasingly becomes a bottleneck. Current GPU memory hierarchies use coarse-grained memory accesses to exploit spatial locality, maximize peak bandwidth, simplify control, and reduce cache meta-data storage. These coarse-grained memory accesses, however, are a poor match for emerging GPU applications with irregular control flow and memory access patterns. Meanwhile, the massive multi-threading of GPUs and the simplicity of their cache hierarchies make CPU-specific memory system enhancements ineffective for improving the performance of irregular GPU applications. We design and evaluate a locality-aware memory hierarchy for throughput processors, such as GPUs. Our proposed design retains the advantages of coarse-grained accesses for spatially and temporally local programs while permitting selective fine-grained access to memory. By adaptively adjusting the access granularity, memory bandwidth and energy are reduced for data with low spatial/temporal locality without wasting control overheads or prefetching potential for data with high spatial locality. As such, our locality-aware memory hierarchy improves GPU performance, energy-efficiency, and memory throughput for a large range of applications.Keywords
Funding Information
- National Science Foundation (954107)
- Intel Corporation
This publication has 38 references indexed in Scilit:
- OWL2013
- Characterizing and improving the use of demand-fetched caches in GPUs2012
- Improving GPU performance via large warps and two-level warp scheduling2011
- Future scaling of processor-memory interfaces2009
- Increasing memory miss tolerance for SIMD cores2009
- High-throughput sequence alignment using Graphics Processing UnitsBMC Bioinformatics, 2007
- Summary cache: a scalable wide-area Web cache sharing protocolIEEE/ACM Transactions on Networking, 2000
- The pool of subsectors cache design1999
- Efficient hardware hashing functions for high performance computersIEEE Transactions on Computers, 1997
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970