Analytical model for analysis of cache behavior during cholesky factorization and its variants

Proceedings of the International Conference on Parallel Processing Workshops

Volumn , Issue , 2004, Pages 190-197

  Šimeček, Ivan ^a   Tvrdík, Pavel ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

CHOLESKY FACTORIZATION; LINEAR CODES; LOOP BLOCKING; LOOP FUSION;

ALGORITHMS; BUFFER STORAGE; ESTIMATION; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; PROBABILITY; VECTORS;

LINEAR ALGEBRA;

EID: 10044286066     PISSN: 15302016     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPPW.2004.1328017     Document Type: Conference Paper

References (8)

1. N. Ahmed, N. Mateev, and K. Pingali. Tiling imperfectlynested loop nests. In Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM), page 31. IEEE Computer Society, 2000.
2. K. Beyls and E. D'Hollander. Reuse distance as a metric for cache behavior. In Proceedings of PDCS'01, pages 617-662, August 2001.
3. S. Carr and K. Kennedy. Compiler blockability of numerical algorithms. In Proceedings of the 1992 ACM/IEEE conference on Supercomputing, pages 114-124. IEEE Computer Society Press, 1992.
4. S. Carr and R. B. Lehoucq. A compiler-blockable algorithm for QR decomposition. In Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, San Francisco, CA, February 1995.
5. N. J. Higham. Accuracy and Stability of Numerical Algorithms. Society for Industrial & Applied Mathematics, 1996.
6. K. Kennedy and J. R. Allen. Optimizing compilers for modern architectures: a dependence-based approach. Morgan Kaufmann Publishers Inc., 2002.
7. X. Vera and J. Xue. Efficient compile-time analysis of cache behaviour for programs with IF statements, October 2002.
8. K. R. Wadleigh and I. L. Crawford. Software optimization for high performance computing. Hewlett-Packard professional books, 2000.