An efficient solver for Cache Miss Equations

2000 IEEE International Symposium on Performance Analysis of Systems and Software, ISPASS 2000

Volumn , Issue , 2000, Pages 139-145

  Bermudo, N ^a   Vera, X ^a   Gonzalez A ^a   Llosa, J ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

CACHE BEHAVIOR; CACHE MISS EQUATIONS; COMPUTATION COSTS; EFFICIENT SOLVERS; EXPONENTIAL COMPLEXITY; LINEAR FUNCTIONS; TIME-CONSUMING TASKS;

GEOMETRY;

EID: 84899747534     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPASS.2000.842293     Document Type: Conference Paper

References (6)

1. P. Clauss. Counting solutions to linear and nonlinear constraints through ehrhart polynomials: applications to analyze ans transform scientific programs. In ICS96, pages 278-285, 1996.
2. S. Ghosh, M. Martonosi, and S. Malik. Cache miss equations: an analytical representation of cache misses. In ICS97, pages 317-324, 1997.
3. S. Ghosh, M. Martonosi, and S. Malik. Precise miss analysis for program transformations with caches of arbitrary associativity. In ASPLOS98, 1998.
4. X. Vera, J. Llosa, A. Gonzalez, and C. Ciuraneta. A fast implementation of cache miss equations. Technical Report UPC-DAC-1999-50, Universitat Politècnica de Catalunya, November 1999.
5. D. Wilde. A library for doing polyhedral operations, 1993.
6. M. E. Wolf and M. S. Lam. A data locality optimizing algorithm. In ACM SIGPLAN91, pages 30-44, 1991.