A statistical model of skewed-associativity

This paper presents a statistical model for explaining why skewed-associativity removes conflicts better than set-associativity. We show that, with a high probability, 2-way skewed associativity emulates full associativity for working-sets up to half the cache size, and we show that 3-way skewed-associativity is almost equivalent to full associativity.

[1]  François Bodin,et al.  Skewed Associativity Improves Program Performance and Enhances Predictability , 1997, IEEE Trans. Computers.

[2]  Richard E. Kessler,et al.  Page placement algorithms for large real-indexed caches , 1992, TOCS.

[3]  Koen De Bosschere,et al.  Efficient profile-based evaluation of randomising set index functions for cache memories , 2001, 2001 IEEE International Symposium on Performance Analysis of Systems and Software. ISPASS..

[4]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[5]  Mark Horowitz,et al.  An analytical cache model , 1989, TOCS.

[6]  SeznecAndré A case for two-way skewed-associative caches , 1993 .

[7]  Philippe Flajolet,et al.  An introduction to the analysis of algorithms , 1995 .

[8]  André Seznec A New Case for Skewed-Associativity , 1997 .

[9]  Robert Shaw,et al.  Randomization and Associativity in the Design of Placement-Insensitive Caches , 1993 .

[10]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[11]  André Seznec,et al.  A case for two-way skewed-associative caches , 1993, ISCA '93.

[12]  S. Majumdar,et al.  Analytical Studies of Strategies for Utilization of Cache Memory in Computers , 2000, cond-mat/0001090.

[13]  Philippe Flajolet,et al.  ANALYTIC COMBINATORICS — SYMBOLIC COMBINATORICS , 2002 .

[14]  François Bodin,et al.  Skewed-associative Caches , 1993, PARLE.

[15]  Antonio González,et al.  Randomized Cache Placement for Eliminating Conflicts , 1999, IEEE Trans. Computers.