Automatic blocking of QR and LU factorizations for locality

Proceedings of the ACM SIGPLAN Workshop on Memory System Performance, MSP 2004

Volumn , Issue , 2004, Pages 12-22

  Yi, Qing ^a   Kennedy, Ken ^b   You, Haihang ^c   Seymour, Keith ^c   Dongarra, Jack ^c  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^b RICE UNIVERSITY   (United States)

^c UNIVERSITY OF TENNESSEE   (United States)

Author keywords

Blocking; LAPACK; Locality; Loop optimizations; LU; QR

Indexed keywords

AUTOMATIC ADAPTATION; BLOCKINGS; CACHE HIERARCHIES; COMPUTER MEMORIES; DENSE MATRICES; FACTORIZATION ALGORITHMS; HOUSEHOLDER TRANSFORMATION; LOOP OPTIMIZATIONS; LOOP STRUCTURE; LOOP TRANSFORMATION; LU FACTORIZATION; MACHINE ARCHITECTURES; OPTIMIZERS; SCIENTIFIC APPLICATIONS;

ALGEBRA; ALGORITHMS; COMPUTER OPERATING SYSTEMS; COMPUTERS;

FACTORIZATION;

EID: 33646107115     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065895.1065898     Document Type: Conference Paper

References (25)

1. N. Ahmed, N. Mateev, and K. Pingali. Synthesizing transformations for locality enhancement of imperfectly-nested loop nests. In Proceedings of the 2000 ACM International Conference on Supercomputing, Santa Fe, New Mexico, May 2000.
2. R. Allen and K. Kennedy. Optimizing Compilers fo Modern Architectures. Morgan Kaufmann, San Francisco, October 2001
3. E. Anderson, Z. Bai, C. Bischof, S. Blackford J. Demmel, J. Dongarra, J. D. Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen. LAPACK Users' Guide. The Society for Industrial and Applied Mathematics, 1999.
4. S. Carr and K. Kennedy. Compiler blockability of numerical algorithms. In Proceedings of Supercomputing, Minneapolis, Nov. 1992.
5. S. Carr and K. Kennedy. Improving the ratio of memory operations to floating-point operations in loops. ACM Transactions on Programming Languages and System, 16 (6):1768-1810, 1994.
6. S. Carr and R. Lehoucq. Compiler blockability of dense matrix factorizations. ACM Transactions on Mathematical Software, 23 (3), 1997.
7. L. Carter, J. Ferrante, and S. F. Hummel. Hierarchical Tiling for Improved Superscalar Performance. In Proc. 9th International Parallel Processing Symposium Santa Barbara, CA, Apr. 1995.
8. S. Coleman and K. S. McKinley. Tile size selection using cache organization. In Proceedings of the SIGPLAN Conference on Programming Language esign and mplementation, La Jolla, CA, June 1995.
9. J. Dongarra, J. Bunch, C. Moler, and G. Stewart. LINPACK Users' Guide. Society for Industrial and Applied Mathematics, 1979.
10. J. J. Dongarra, F. G. Gustavson, and A. Karp. Implementing linear algebra algorithms for dense matrices on a vector pipeline machine SAM Review 26 (1):91-112, Jan. 1984.
11. D. Gannon, W. Jalby, and K. Gallivan. Strategies for cache and local memory management by global program transformation. Journal of Parallel and Distributed Computing, 5 (5):587-616, Oct. 1988.
12. W. Kelly, V. Maslov, W. Pugh, E. Rosser, T. Shpeisman, and D. Wonnacott. The Omega Library Interface Guide. Technical report, Dept. of Computer Science, Univ. of Maryland, College Park, Apr. 1996.
13. K. Kennedy. Fast greedy weighted fusion. In Proceedings of the International Conference on Supercomputing, Santa Fe, NM, May 2000.
14. K. Kennedy and K. S. McKinley. Typed fusion with applications to parallel and sequential code generation. Technical Report TR93-208, Dept. of Computer Science, Rice University, Aug. 1993. (also available as CRPC-TR94370)
15. I. Kodukula, N. Ahmed, and K. Pingali. Data-centric multilevel blocking. In Proceedings of the SIGPLAN '97 Conference on Programming Language Design and mplementation, Las Vegas, NV, June 1997.
16. M. Lam, E. Rothberg, and M. E. Wolf. The cache performance and optimizations of blocked algorithms In Proceedings of the Fourth International Conference on rchitectural Support fo Programming Languages and Operating Systems (ASPLOS-IV), Santa Clara, Apr. 1991
17. A. W. Lim, G. I. Cheong, and M. S. Lam. An affine partitioning algorithm to maximize parallelism and minimize communication. In Proceedings of the 13th ACM SIGARCH International Conference on Supercomputing, Rhodes, Greece, June 1999.
18. K. S. McKinley, S. Carr, and C. W. Tseng. Improving data locality with loop transformations. ACM Transactions on Programming Languages and Systems, 18 (4):424-453, July 1996.
19. N. Mitchell, L. Carter, J. Ferrante, and K. Hgstedt Quantifying the multilevel nature of tiling interactions. In 10th International Workshop on Languages and Comilers fo Parallel Computing August 1997.
20. W. Pugh. Uniform techniques for loop optimization. In Proceedings of the 1991 ACM International Conference on Supercomputing, Cologne ermany, June 1991
21. G. Rivera and C.-W. Tseng. Data transformations for eliminating conflict misses. In ACM SIGPLAN Conference on Programming Language Design and mplementation, Montreal, Canada, June 1998.
22. William Pugh and Evan Rosser. Iteration Space Slicing For Locality. In LCC 99, July 1999.
23. M. E. Wolf and M. Lam. A data locality optimizing algorithm. In Proceedings of the SIGPLAN Conference on Programming Language Design and mplementation, Toronto, June 1991
24. M. J. Wolfe. Optimizing Supercompilers for Supercomputers. The MIT Press, Cambridge, MA, 1989.
25. Q. Yi, K. Kennedy, and V. Adve. Transforming complex loop nests for locality. The Journal Of Supercomputing, 27:219-264, 2004.