Using Prime Numbers for Cache Indexing to Eliminate Conflict Misses
Top Cited Papers
- 31 March 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- On randomly interleaved memoriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A direct-execution framework for fast and accurate simulation of superscalar processorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multiplicative, congruential random-number generators with multiplier ± 2
k
1
± 2
k
2
and modulus 2
p
- 1ACM Transactions on Mathematical Software, 1997
- Skewed associativity improves program performance and enhances predictabilityIEEE Transactions on Computers, 1997
- The design and performance of a conflict-avoiding cachePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- Prime Numbers and Computer Methods for FactorizationPublished by Springer Nature ,1994
- Vector Access Performance in Parallel Memories Using a Skewed Storage SchemeIEEE Transactions on Computers, 1987
- The Prime Memory System for Array AccessIEEE Transactions on Computers, 1982
- The Organization and Use of Parallel MemoriesIEEE Transactions on Computers, 1971
- Coding the Lehmer pseudo-random number generatorCommunications of the ACM, 1969