A Case for MLP-Aware Cache Replacement
Authors:
Open Access
- 1 May 2006
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 34 (2) , 167-178
Abstract
Performance loss due to long-latency memory accesses can be reduced by servicing multiple memory accesses concurrently. The notion of generating and servicing long-latency cache misses in parallel is called Memory Level Parallelism (MLP). MLP is not uniform across cache misses - some misses occur in isolation while some occur in parallel with other misses. Isolated misses are more costly on performance than parallel misses. However, traditional cache replacement is not aware of the MLP-dependent cost differential between different misses. Cache replacement, if made MLP-aware, can improve performance by reducing the number of performance-critical isolated misses. This paper makes two key contributions. First, it proposes a framework for MLP-aware cache replacement by using a runtime technique to compute the MLP-based cost for each cache miss. It then describes a simple cache replacement mechanism that takes both MLP-based cost and recency into account. Second, it proposes a novel, low-hardware overhead mechanism called Sampling Based Adaptive Replacement (SBAR), to dynamically choose between an MLP-aware and a traditional replacement policy, depending on which one is more effective at reducing the number of memory related stalls. Evaluations with the SPEC CPU2000 benchmarks show that MLP-aware cache replacement can improve performance by as much as 23%.Keywords
This publication has 12 references indexed in Scilit:
- The V-Way Cache: Demand Based Associativity via Global Replacement2005
- Kilo-Instruction Processors: Overcoming the Memory WallIEEE Micro, 2005
- Dual-core execution: building a highly scalable single-thread instruction window2005
- Using SimPoint for accurate and efficient simulationACM SIGMETRICS Performance Evaluation Review, 2003
- The memory gap and the future of high performance memoriesACM SIGARCH Computer Architecture News, 2001
- A fully associative software-managed cache design2000
- Optimal replacements in caches with two miss costs1999
- Improving data cache performance by pre-executing instructions under a cache miss1997
- Thek-server dual and loose competitiveness for pagingAlgorithmica, 1994
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966