Evaluation of the Performance of Polynomial Set Index Functions.pdfVIP

Evaluation of the Performance of Polynomial Set Index Functions Hans Vandierendonck and Koen De Bosschere Dept. of Electronics and Information Systems Ghent University, Sint-Pietersnieuwstraat 41, 9000 Gent, Belgium E-mail: fhvdieren,kdbg @elis.rug.ac.be Abstract In [6, 7, 14, 15], the class of functions based on division of polynomials over (2), originally proposed for inter- Randomising set index functions, randomisation func- leaved memories in vector processors [10], is promoted for tions for short, can significantly reduce conflict misses in use as set index functions for data caches. The perfor- data caches by placing cache blocks in a conflict-free man- mance of these functions in the presence of stride-based ner. XOR-based functions are a broad class of functions access patterns can be shown to be predictable. Except that generally exhibit few conflict misses. Topham and for a few functions in [7], no comparisons between these Gonzalez claimed that the sub-class of functions based on functions, called polynomial randomisation functions , and ´ division of polynomials over (2) contains those func- other XOR-based randomisation functions are made. Fur- tions that achieve the best conflict-free mapping. Further- thermore, it is claimed that polynomials that are irreducible, more, they claim that an even smaller class of functions, which means that they cannot be written as the product of namely those based on irreducible polynomial