Skip to Main content Skip to Navigation
Conference papers

A Dueling Segmented LRU Replacement Algorithm with Adaptive Bypassing

Abstract : In this paper we present a high performance cache replacement algorithm called Dueling Segmented LRU replacement algorithm with adaptive Bypassing (DSB). The base algorithm is Segmented LRU (SLRU) replacement algorithm originally proposed for disk cache management. We introduce three enhancements to the base SLRU algorithm. First, a newly allocated line could be randomly promoted for better protection. Second, an aging algorithm is used to remove stale cache lines. Most importantly, we propose a novel scheme to track whether cache bypassing is effective. Based on the tracking results, we can adaptively adjust bypassing to fit workload behavior. DSB algorithm is implemented with a policy selector to dynamically select two variants of SLRU algorithms with different enhancements.
Document type :
Conference papers
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/inria-00492965
Contributor : Ist Rennes Connect in order to contact the contributor
Submitted on : Thursday, June 17, 2010 - 2:55:50 PM
Last modification on : Monday, June 20, 2016 - 2:10:32 PM
Long-term archiving on: : Monday, September 20, 2010 - 5:01:22 PM

File

005_gao.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00492965, version 1

Collections

Citation

Hongliang Gao, Chris Wilkerson. A Dueling Segmented LRU Replacement Algorithm with Adaptive Bypassing. JWAC 2010 - 1st JILP Worshop on Computer Architecture Competitions: cache replacement Championship, Jun 2010, Saint Malo, France. ⟨inria-00492965⟩

Share

Metrics

Record views

499

Files downloads

970