NDLI: Counter-based cache replacement algorithms

Content Provider	IEEE Xplore Digital Library
Author	Kharbutli, M. Solihin, Y.
Copyright Year	2005
Description	Author affiliation: Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA (Kharbutli, M.; Solihin, Y.)
Abstract	Recent studies have shown that in highly associative caches, the performance gap between the least recently used (LRU) and the theoretical optimal replacement algorithms is large, suggesting that alternative replacement algorithms can improve the performance of the cache. One main reason for this performance gap is that in the LRU replacement algorithm, a line is only evicted after it becomes the LRU line, long after its last access/touch, while unnecessarily occupying the cache space for a long time. This paper proposes a new approach to deal with the problem: counter-based L2 cache replacement. In this approach, each line in the L2 cache is augmented with an event counter that is incremented when an event of interest, such as a cache access to the same set, occurs. When the counter exceeds a threshold, the line "expires", and becomes evictable. When expired lines are evicted early from the cache, they make extra space for lines that may be more useful, reducing the number of capacity and conflict misses. Each line's threshold is unique and is dynamically learned and stored in a small 40-Kbyte counter prediction table. We propose two new replacement algorithms: access interval predictor (AIP) and live-time predictor (LvP). AIP and LvP speed up 10 (out of 21) SPEC2000 benchmarks by up to 40% and 11% on average.
Sponsorship	IEEE Comput. Soc. Design Autom. Tech. Comm. (DATC) IEEE Circuits and Syst. Soc. Cadence Intel
Starting Page	61
Ending Page	68
File Size	360438
Page Count	8
File Format	PDF
ISBN	0769524516
DOI	10.1109/ICCD.2005.41
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-10-02
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Counting circuits Prediction algorithms Career development Turning
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Counter-Based Cache Replacement and Bypassing Algorithms

Counter-based cache replacement algorithms (2005)

Counter-based cache replacement algorithms (2005)

Adapted discrete-based entropy cache replacement algorithm

Using counter-proposal to optimize genetic algorithm based cooperative negotiation

Information-Preserving Logic Based on Logical Reversibility to Reduce the Memory Data Transfer Bottleneck and Heat Dissipation

The effect of using state-based priority information in a shared-memory multiprocessor cache replacement policy

MRU-Tour-based Replacement Algorithms for Last-Level Caches

MRAC: A Memristor-based Reconfigurable Framework for Adaptive Cache Replacement

Counter-based cache replacement algorithms

Similar Documents

Counter-Based Cache Replacement and Bypassing Algorithms

Counter-based cache replacement algorithms (2005)

Counter-based cache replacement algorithms (2005)

Adapted discrete-based entropy cache replacement algorithm

Using counter-proposal to optimize genetic algorithm based cooperative negotiation

Information-Preserving Logic Based on Logical Reversibility to Reduce the Memory Data Transfer Bottleneck and Heat Dissipation

The effect of using state-based priority information in a shared-memory multiprocessor cache replacement policy

MRU-Tour-based Replacement Algorithms for Last-Level Caches

MRAC: A Memristor-based Reconfigurable Framework for Adaptive Cache Replacement

Counter-based cache replacement algorithms