A Dueling Segmented LRU Replacement Algorithm with Adaptive Bypassing - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

A Dueling Segmented LRU Replacement Algorithm with Adaptive Bypassing

Hongliang Gao
  • Fonction : Auteur
  • PersonId : 872216
Chris Wilkerson
  • Fonction : Auteur
  • PersonId : 872217

Résumé

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.
Fichier principal
Vignette du fichier
005_gao.pdf (93.61 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00492965 , version 1 (17-06-2010)

Identifiants

  • HAL Id : inria-00492965 , version 1

Citer

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⟩

Collections

ISCA2010 JWAC2010
563 Consultations
1172 Téléchargements

Partager

Gmail Facebook X LinkedIn More