Insertion Policy Selection Using Decision Tree Analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Insertion Policy Selection Using Decision Tree Analysis


The last-level cache (LLC) mitigates the impact of long memory access latencies in today's microarchitectures. The insertion policy in the LLC can have a significant impact on cache efficiency. However, a fixed insertion policy can allow useless blocks to remain in the cache longer than necessary, resulting in inefficiency. We introduce insertion policy selection using Decision Tree Analysis (DTA). The technique requires minimal hardware modification over the least-recently-used (LRU) replacement policy. This policy uses the fact that the LLC filters temporal locality. Many of the lines brought to the cache are never accessed again. Even if they are reaccessed they do not experience bursts, but rather they are reused when they are near to the LRU position in the LRU stack. We use decision tree analysis of multi-set-dueling to choose the optimal insertion position in the LRU stack. Inserting in this position, zero reuse lines minimize their dead time while the non-zero reuse lines remain in the cache long enough to be reused and avoid a miss. For a 1MB 16 way set-associative last level cache in a single core processor, our entry uses only 2069 bits over the LRU replacement policy.
Fichier principal
Vignette du fichier
007_khan.pdf (56.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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


  • HAL Id : inria-00492972 , version 1


Samira Khan, Daniel A. Jimenez. Insertion Policy Selection Using Decision Tree Analysis. JWAC 2010 - 1st JILP Worshop on Computer Architecture Competitions: cache replacement Championship, Jun 2010, Saint Malo, France. ⟨inria-00492972⟩


ISCA2010 JWAC2010
41 View
207 Download


Gmail Facebook X LinkedIn More