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.
Type de document :
Communication dans un congrès
Joel Emer. JWAC 2010 - 1st JILP Worshop on Computer Architecture Competitions: cache replacement Championship, Jun 2010, Saint Malo, France. 2010
Liste complète des métadonnées

Littérature citée [4 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00492965
Contributeur : Ist Rennes <>
Soumis le : jeudi 17 juin 2010 - 14:55:50
Dernière modification le : lundi 20 juin 2016 - 14:10:32
Document(s) archivé(s) le : lundi 20 septembre 2010 - 17:01:22

Fichier

005_gao.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00492965, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

601

Téléchargements de fichiers

966