A statistical model of skewed-associativity

Authors:
P. Michaud
Affiliations:
IRISA/INRIA, France
Venue:
ISPASS '03 Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software
Year:
2003

Citing 0
Cited 2

XOR-Based Hash Functions

IEEE Transactions on Computers
YAARC: yet another approach to further reducing the rate of conflict misses

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.