Adaptive Subset Based Replacement Policy for High Performance Caching

Abstract : An Adaptive Subset Based Replacement Policy (ASRP) is proposed in this paper. In ASRP policy, each set in Last-Level Cache (LLC) is divided into multiple subsets, and one subset is active and others are inactive at a given time. The victim block for a miss is only chosen from the active subset using LRU policy. A counter in each set records the cache misses in the set during a period of time. When the value of the counter is greater than a threshold, the active subset is changed to the neighbor one. To adapt the program behavior changing, set dueling is used to choose a threshold from different thresholds according to which one causes the least number of misses in the sampling sets. Using the given framework for this competition our ASRP policy gets a geometric average of improvement over LRU by 4.5% for 28 SPEC CPU 2006 programs and some programs gain improvements up to 50%.
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 [11 références]  Voir  Masquer  Télécharger

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

Fichier

008_he.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00492980, version 1

Collections

Citation

Liqiang He, Yan Sun, Chaozhong Zhang. Adaptive Subset Based Replacement Policy for High Performance Caching. Joel Emer. JWAC 2010 - 1st JILP Worshop on Computer Architecture Competitions: cache replacement Championship, Jun 2010, Saint Malo, France. 2010. 〈inria-00492980〉

Partager

Métriques

Consultations de la notice

112

Téléchargements de fichiers

64