| A. Gonzalez, M. Valero, N. Topham and J.M. Parcerisa. Eliminating Cache Con- ict Misses Through XOR-Based Placement Functions. In ACM International Conference on Supercomputing (ICS), 76-83, 1997. |
....through this space, as was done in [VDB02] 2. 1 Randomisation Functions Several researchers have advocated the use of randomisation over bit selection for index functions, both for interleaving [Rau91, FJL85, VLL 89, VLA92, HIL89, RH90, Soh93, Soh88] and for set index functions [TGG97, GVTP97, TG99, GVTP96, SSS93, SCE99, Sez93, BS95, AP93, AHH88] Randomisation functions have the bene t that they can avoid stereotypical bad behaviour that occurs when the distance between addresses is a power of 2. Randomisation functions can be constructed that provide con ict free mapping for the ....
A. Gonzalez, M. Valero, N. Topham, and J.M. Parcerisa. Eliminating cache con ict misses through XOR-based placement functions. In ICS'97. Proceedings of the 1997 International Conference on Supercomputing, pages 76-83, July 1997.
No context found.
A. Gonzalez, M. Valero, N. Topham and J.M. Parcerisa. Eliminating Cache Con- ict Misses Through XOR-Based Placement Functions. In ACM International Conference on Supercomputing (ICS), 76-83, 1997.
No context found.
A. Gonzalez, M. Valero, N. Topham, and J. M. Parcerisa. Eliminating cache con ict misses through xor-based placement functions. In Proceedings of the 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC