A New Case for Skewed-Associativity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1997

A New Case for Skewed-Associativity


Skewed-associative caches have been shown to statisticaly exhibit lower miss ratios than set-associative caches at equal associativity degrees. But for L1 caches, the performance of a four-way set-associative cache is known to be quite close to that of a 16-way set-associative cache. In this paper, we first show that BTBs and L2 caches featuring long line size may benefit a lot from a high associativity degree on set-associative caches and a LRU replacement policy. Skewed-associative caches with an hypothetic LRU replacement policy «provide» this high associativity but with a low number of cache banks. Unfortunately, LRU replacement policies can not be easily implemented in hardware on skewed-associative caches. We propose some new replacement heuristics for skewed-associative caches. Those heuristics exhibit slightly worse behavior than a full LRU replacement policy, but still allow a 2-way skewed-associative cache to outperform a 4-way LRU set-associative cache and a 4-way skewed-associative cache to outperform a 16-way LRU set-associative cache. Therefore skewed-associativity allows significant miss reduction on BTBs and L2 caches.
Fichier principal
Vignette du fichier
RR-3208.pdf (273.11 Ko) Télécharger le fichier

Dates and versions

inria-00073481 , version 1 (24-05-2006)


  • HAL Id : inria-00073481 , version 1


André Seznec. A New Case for Skewed-Associativity. [Research Report] RR-3208, INRIA. 1997. ⟨inria-00073481⟩
225 View
696 Download


Gmail Facebook X LinkedIn More