Cache behavior modelling for codes involving banded matrices

Authors:
Diego Andrade;Basilio B. Fraguela;Ramón Doallo
Affiliations:
Universidade da Coruña, Dept. de Electrénica e Sistemas, Facultade de Informática, Coruña, Spain;Universidade da Coruña, Dept. de Electrénica e Sistemas, Facultade de Informática, Coruña, Spain;Universidade da Coruña, Dept. de Electrénica e Sistemas, Facultade de Informática, Coruña, Spain
Venue:
LCPC'06 Proceedings of the 19th international conference on Languages and compilers for parallel computing
Year:
2006

Citing 12
Cited 1

Direct methods for sparse matrices

Direct methods for sparse matrices
Trace-driven memory simulation: a survey

ACM Computing Surveys (CSUR)
Exploiting hardware performance counters with flow and context sensitive profiling

Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Cache performance analysis of traversals and random accesses

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Cache miss equations: a compiler framework for analyzing and tuning memory behavior

ACM Transactions on Programming Languages and Systems (TOPLAS)
Exact analysis of the cache behavior of nested loops

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
A Modal Model of Memory

ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Compile-time performance prediction of scientific programs

Compile-time performance prediction of scientific programs
Cache Probabilistic Modeling for Basic Sparse Algebra Kernels Involving Matrices with a Non Uniform Distribution

EUROMICRO '98 Proceedings of the 24th Conference on EUROMICRO - Volume 1
Efficient and Accurate Analytical Modeling of Whole-Program Data Cache Behavior

IEEE Transactions on Computers
Analytical modeling of codes with arbitrary data-dependent conditional structures

Journal of Systems Architecture: the EUROMICRO Journal
Precise automatable analytical modeling of the cache behavior of codes with indirections

ACM Transactions on Architecture and Code Optimization (TACO)

Precise automatable analytical modeling of the cache behavior of codes with indirections

ACM Transactions on Architecture and Code Optimization (TACO)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Understanding and improving the memory hierarchy behavior is one of the most important challenges in current architectures. Analytical models are a good approach for this, but they have been traditionally limited by either their restricted scope of application or their lack of accuracy. Most models can only predict the cache behavior of codes that generate regular access patterns. The Probabilistic Miss Equation(PME) model is able nevertheless to model accurately the cache behavior for codes with irregular access patterns due to data-dependent conditionals or indirections. Its main limitation is that it only considers irregular access patterns that exhibit an uniform distribution of the accesses. In this work, we extend the PME model to enable to analyze more realistic and complex irregular accesses. Namely, we consider indirections due to the compressed storage of most real banded matrices.