Cited By
View all- Fedorov VQiu SReddy AGratz P(2013)ARIACM Transactions on Architecture and Code Optimization10.1145/254369710:4(1-19)Online publication date: 1-Dec-2013
Dueling CLOCK: adaptive cache replacement policy based on the CLOCK algorithm
Abstract
We consider the problem of on-chip L2 cache management and replacement policies. We propose a new adaptive cache replacement policy, called Dueling CLOCK (DC), that has several advantages over the Least Recently Used (LRU) cache replacement policy.
LRU's strength is that it keeps track of the 'recency' information of memory accesses. However, a) LRU has a high overhead cost of moving cache blocks into the most recently used position each time a cache block is accessed; b) LRU does not exploit 'frequency' information of memory accesses; and, c) LRU is prone to cache pollution when a sequence of single-use memory accesses that are larger than the cache size is fetched from memory (i.e., it is non scan resistant).
The DC policy was developed to have low overhead cost, to capture 'recency' information in memory accesses, to exploit the 'frequency' pattern of memory accesses and to be scan resistant. In this paper, we propose a hardware implementation of the CLOCK algorithm for use within an on-chip cache controller to ensure low overhead cost. We then present the DC policy, which is an adaptive replacement policy that alternates between the CLOCK algorithm and the scan resistant version of the CLOCK algorithm.
We present experimental results showing the MPKI (Misses per thousand instructions) comparison of DC against existing replacement policies, such as LRU. The results for an 8-way 1MB L2 cache show that DC can lower the MPKI of SPEC CPU2000 benchmark by an average of 10.6% when compared to the tree based Pseudo-LRU cache replacement policy.
References
[1]
S. Bansal and D. S. Modha, "CAR: Clock with Adaptive Replacement," USENIX Symposium on File and Storage Technologies, March, 2004.
[2]
L. A. Belady, "A Study of Replacement Agorithms for A Virtual-Storage Computer," IBM Systems Journal, pp. 78--101, 1966.
[3]
D. C. Burger and T. M. Austin, "The SimpleScalar tool-set, Version 2.0," Technical Report 1342, Department of Computer Science, UW, June, 1997.
[4]
J. Edler and M. D. Hill, "Dinero IV Trace-Driven Uniprocessor Cache Simulator," http://www.cs.wisc.edu/~markhill/DineroIV/.
[5]
J. P. Grossman, "A Systolic Array for Implementing LRU Replacement," MIT-AI Aries Group Technical Memos, (http://www.ai.mit.edu.projects/aries/Documents/Memos/ARIES-18.pdf) March 2002.
[6]
J. Handy, "The Cache Memory Book," Academic Press, London, 1998.
[7]
S. Jian and X. Zhang, "LIRS: An efficient low inter-reference recency set replacement policy to improve buffer cache performance," ACM SIGMETRICS, 2002.
[8]
T. Johnson and D. Shasha, "2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm," VLDB, 1994.
[9]
M. Kampe, P. Stenstrom and M. Dubois, "Self-CoFIFOecting LRU Replacement Policies," Computing Frontiers, Italy, 2004.
[10]
A. J. Loper et al., "Method for Implementing a Four-Way Least Recently Used (LRU) Mechanism in High Performance," US Patent 5,765,191 9 June 1998.
[11]
N. Megiddo and D. S. Modha, "ARC: A self-tuning, low overhead replacement cache," 2nd USENIX Conference on File and Storage Technologies, San Francisco, 2003.
[12]
E. J. O'Neil, P. E. O'Neil and G. Weikum, "The LRU-K page replacement algorithm for database disk buffering," ACM SIGMOD, pp. 297--306, 1993.
[13]
M. K. Qureshi et al., "Adaptive Insertion Policies for High Performance Caching," ISCA, San Diego, 2007.
[14]
J. T. Robinson and M. V. Devarakonda, "Data Cache Management using Frequency Based Replacement," SIGMETRICS, pp. 134--142, 1990.
[15]
T. Sherwook et al., "Automatically Characterizing Large Scale Program Behavior," International Conference on Architectural Support for Programming Languages and Operating Systems, October 2002.
[16]
Standard Performance Evaluation Corporation. SPEC2000. http://www.spec.org.
[17]
R. Subramanian, Y. Smaragdakis and G. H. Log, "Adaptive Caches: Effective Shaping of Cache Behavior to Workloads," IEEE MICRO 39, 2006.
[18]
Synopsys, Inc., "Design Compiler," http://www.synopsys.com.
[19]
Taiwan Semiconductor Manufacturing Corporation, "TCBN90G," TSMC 90nm Core Library Databook, Oct, 2003.
[20]
S. Thoziyoor, N. Muralimanohar, J. H. Ahn and N. P. Jouppi, "CACTI 5.1, "Technical Report HPL-2008-20, HP Laboratories, Apr. 2, 2008.
Recommendations
CLOCK-pro+: improving CLOCK-pro cache replacement with utility-driven adaptation
SYSTOR '19: Proceedings of the 12th ACM International Conference on Systems and StorageCLOCK-Pro is the low-overhead approximation of the state-of-the-art cache replacement policy, Low Inter-Reference Recency Set (LIRS). It also improves the static cache space allocation in LIRS with simple heuristics to adapt to LRU-friendly workloads. ...
Set-Dueling-Controlled Adaptive Insertion for High-Performance Caching
The commonly used LRU replacement policy causes thrashing for memory-intensive workloads. A simple mechanism that dynamically changes the insertion policy used by LRU replacement reduces cache misses by 21 percent and requires a total storage overhead ...
CLOCK-Pro: an effective improvement of the CLOCK replacement
ATEC '05: Proceedings of the annual conference on USENIX Annual Technical ConferenceWith the ever-growing performance gap between memory systems and disks, and rapidly improving CPU performance, virtual memory (VM) management becomes increasingly important for overall system performance. However, one of its critical components, the ...
Comments
Information & Contributors
Information
Published In
March 2010
1868 pages
ISBN:9783981080162
- General Chairs:
- Giovanni De Micheli,
- Bashir Al-Hashimi,
- Program Chairs:
- Wolfgang Mueller,
- Enrico Macii
Sponsors
- EDAA: European Design Automation Association
- ECSI
- EDAC: Electronic Design Automation Consortium
- SIGDA: ACM Special Interest Group on Design Automation
- The IEEE Computer Society TTTC
- The IEEE Computer Society DATC
- The Russian Academy of Sciences: The Russian Academy of Sciences
Publisher
European Design and Automation Association
Leuven, Belgium
Publication History
Published: 08 March 2010
Check for updates
Qualifiers
- Research-article
Conference
DATE '10
Sponsor:
- EDAA
- EDAC
- SIGDA
- The Russian Academy of Sciences
Acceptance Rates
Overall Acceptance Rate 518 of 1,794 submissions, 29%
Upcoming Conference
DATE '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 216Total Downloads
- Downloads (Last 12 months)9
- Downloads (Last 6 weeks)1
Reflects downloads up to 25 Jan 2025
Other Metrics
Citations
Cited By
View all- Fedorov VQiu SReddy AGratz P(2013)ARIACM Transactions on Architecture and Code Optimization10.1145/254369710:4(1-19)Online publication date: 1-Dec-2013
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in