The design and performance of a conflict-avoiding cache

N. Topham, A. Gonzalez, J. Gonzalez

Research output: Chapter in Book/Report/Conference proceedingConference contribution


High performance architectures depend heavily on efficient multi-level memory hierarchies to minimize the cost of accessing data. This dependence will increase with the expected increases in relative distance to main memory. There have been a number of published proposals for cache conflict-avoidance schemes. We investigate the design and performance of conflict-avoiding cache architectures based on polynomial modulus functions, which earlier research has shown to be highly effective at reducing conflict miss ratios. We examine a number of practical implementation issues and present experimental evidence to support the claim that pseudo-randomly indexed caches are both effective in performance terms and practical from an implementation viewpoint
Original languageEnglish
Title of host publicationMicroarchitecture, 1997. Proceedings., Thirtieth Annual IEEE/ACM International Symposium on
Number of pages10
Publication statusPublished - 1 Dec 1997


  • cache storage
  • memory architecture
  • performance evaluation
  • polynomials
  • cache architecture design
  • conflict miss ratios
  • conflict-avoiding cache performance
  • data access cost minimization
  • high performance architectures
  • main memory
  • multi-level memory hierarchies
  • polynomial modulus functions
  • Costs
  • Indexing
  • Pathology
  • Polynomials
  • Robustness


Dive into the research topics of 'The design and performance of a conflict-avoiding cache'. Together they form a unique fingerprint.

Cite this