Optimizing cache miss equations polyhedra

  • Authors:

  • Nerina Bermudo;Xavier Vera;Antonio González;Josep Llosa

  • Affiliations:

  • Computer Architecture Department, Universitat Politècnica de Catalunya-axcelona;Computer Architecture Department, Universitat Politècnica de Catalunya-axcelona;Computer Architecture Department, Universitat Politècnica de Catalunya-axcelona;Computer Architecture Department, Universitat Politècnica de Catalunya-axcelona

  • Venue:
  • ACM SIGARCH Computer Architecture News - Special issue on interaction between compilers and computer architectures
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cache Miss Equations (CME) [GMM97] is a method that accurately describes the cache behavior by means of polyhedra. Even though the computation cost of generating CME is a linear function of the number of references, to solve them is a very time consuming task and thus trying to study a whole program may be infeasible.In this work, we present effective techniques that exploit some properties of the particular polyhedra generated by CME. Such technique reduce the complexity of the algorithm to solve CME, which results in a significant speed-up when compared with traditional methods. In particular, the proposed approach does not require the computation of the vertices of each polyhedron, which has an exponential complexity.