A data locality optimizing algorithm

ACM SIGPLAN Notices

Volumn 39, Issue 4, 2004, Pages 445-459

  Wolf, Michael E ^a   Lam, Monica S ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA LOCALITY; OPTIMIZING ALGORITHM; PARALLELIZATION PROBLEM;

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL METHODS; DATA COMMUNICATION SYSTEMS; MULTIPROCESSING SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

PROGRAM COMPILERS;

EID: 3142767727     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (18)

1. W. Abu-Sufah. Improving the Performance of Virtual Memory Computers. PhD thesis, University of Illinois at Urbana-Champaign, Nov 1978.
2. U. Banerjee. Data dependence in ordinary programs. Technical Report 76-837, University of Illinios at Urbana-Champaign, Nov 1976.
3. U. Banerjee. Dependence Analysis for Supercomputing. Kluwer Academic, 1988.
4. U. Banerjee. Unimodular transformations of double loops. In 3rd Workshop on Languages and Compilers for Parallel Computing, Aug 1990.
5. D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. In Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation, June 1990.
6. J. Dongarra, J. Du Croz, S. Hammarling, and I. Duff. A set of level 3 basic linear algebra subprograms. ACM Transactions on Mathematical Software, pages 1-17, March 1990.
7. K. Gallivan, W. Jalby, U. Meier, and A. Sameh. The impact of hierarchical memory systems on linear algebra algorithm design. Technical report, University of Illinios, 1987.
8. 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:587-616, 1988.
9. G. H. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins University Press, 1989.
10. F. Irigoin and R. Triolet. Computing dependence direction vectors and dependence cones. Technical Report E94, Centre D'Automatique et Informatique, 1988.
11. F. Irigoin and R. Triolet. Supernode partitioning. In Proc. 15th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, January 1988.
12. M. S. Lam, E. E. Rothberg, and M. E. Wolf. The cache performance and optimizations of blocked algorithms. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, April 1991.
13. A. C. McKeller and E. G. Coffman. The organization of matrices and matrix operations in a paged multiprogramming environment. CACM, 12(3):153-165, 1969.
14. A. Porterfield. Software Methods for Improvement of Cache Performance on Supercomputer Applications. PhD thesis, Rice University, May 1989.
15. R. Schreiber and J. Dongarra. Automatic blocking of nested loops. 1990.
16. M. E. Wolf and M. S. Lam. A loop transformation theory and an algorithm to maximize parallelism. IEEE Transactions on Parallel and Distributed Systems, July 1991.
17. M. J. Wolfe. Techniques for improving the inherent parallelism in programs. Technical Report UIUCDCS-R-78-929, University of Illinois, 1978.
18. M. J. Wolfe. More iteration space tiling. In Supercomputing '89, Nov 1989.