Compile-time composition of run-time data and iteration reorderings

ACM SIGPLAN Notices

Volumn 38, Issue 5, 2003, Pages 91-102

  Strout, Michelle Mills ^a   Carter, Larry ^a   Ferrante, Jeanne ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Data remapping; Inspector executor; Iteration reordering; Optimization; Run time transformations; Sparse tiling

Indexed keywords

ALGORITHMS; CACHE MEMORY; DATA PROCESSING; DATA STRUCTURES; OPTIMIZATION; PROGRAM COMPILERS; STORAGE ALLOCATION (COMPUTER);

COMPILE-TIME COMPOSITION; DATA REMAPPING; INSPECTOR-EXECUTOR; ITERATION REORDERING; RUN-TIME TRANSFORMATIONS; SPARSE TILING;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 1442264347     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/780822.781142     Document Type: Conference Paper

References (33)

1. N. Ahmed, N. Mateev, and K. Pingali. Synthesizing transformations for locality enhancement of imperfectly-nested loop nests. In Proceedings of the 2000 International Conference on Supercomputing, pages 141-152, May 2000.
2. I. Al-Furaih and S. Ranka. Memory hierarchy management for iterative graph structures. In Proceedings of the 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, pages 298-302, Los Alamitos, March 30-April 3 1998.
3. S. Carr, K. S. McKinley, and C. Tseng. Compiler optimizations for improving data locality. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, pages 252-262, November 1994.
4. E. Cuthill and J. McKee. Reducing the bandwidth of sparse symmetric matrices. In Proceedings of the 24th National Conference ACM, pages 157-172, 1969.
5. R. Das, D. Mavriplis, J. Saltz, S. Gupta, and R. Ponnusamy. The design and implementation of a parallel unstructured Euler solver using software primitives, In Proceedings of the 30th Aerospace Sciences Meeting, 1992.
6. R. Das, M. Uysal, J. Saltz, and Yuan-Shin S. Hwang. Communication optimizations for irregular scientific computations on distributed memory architectures. Journal of Parallel and Distributed Computing. 22(3)462-478, 1994.
7. C. Ding and K. Kennedy. Improving cache performance in dynamic applications through data and computation reorganization at run time. In Proceedings of the ACM SIGPLAN 1999 Conference on Programming Language Design and Implementation, ACM SIGPLAN Notices, 229-241, May 1-4, 1999.
8. C. Ding and K. Kennedy. Inter-array data regrouping. In Twelfth International Workshop on Languages and Compilers for Parallel Computing. Springer-Verlag, August 1999.
9. C. C. Douglas, J. Hu, M. Kowarschik, U. Rüde, and C. Weiss. Cache Optimization for Structured and Unstructured Grid Multigrid. Electronic Transaction on Numerical Analysis, 10:21-40, February 2000.
10. B. Grant, M. Mock, M. Philipose, C. Chambers, and S. J. Eggers. DyC: an expressive annotation-directed dynamic compiler for C. Theoretical Computer Science, 248(1-2):147-199, 2000.
11. E. Gutiérrez, R. Asenjo, O. Plata, and E. L. Zapata. Automatic parallelization of irregular applications. Parallel Computing, 26(13-14):1709-1738, 2000.
12. H. Han and C. Tseng. A comparison of locality transformations for irregular codes. In 5th International Workshop on Languages, Compilers, and Run-time Systems for Scalable Computers. Springer, 2000.
13. E. Im and K. Yelick. Optimizing sparse matrix computations for register reuse in sparsity. In V.N. Alexandrov, J.J. Dongarra, B.A. Juliano, R.S. Renner, and C.J.K. Tan, editors, Computational Science - ICCS 2001, Lecture Notes in Computer Science, pages 127-136, Springer, May 28-30, 2001.
14. M. Kandemir, A. Choudhary, J. Ramanujam, and P. Banerjee. Improving locality using loop and data transformations in an integrated framework. In Proceedings of the 31st Annual ACM/IEEE International Symposium on Microarchitecture, pages 285-296, November 1998.
15. W. Kelly and W. Pugh. Finding legal reordering transformations using mappings. In K. Pingali, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing, volume 892 of Lecture Notes in Computer Science, pages 107-124. Springer, August 8-10, 1994.
16. W. Kelly and W. Pugh. A unifying framework for iteration reordering transformations. Technical Report CS-TR-3430, University of Maryland, College Park, February 1995.
17. Induprakas Kodukula and Keshav Pingali. Transformations for imperfectly nested loops. In Proceedings of 1996 Conference on Supercomputing ACM Press, 1996.
18. W. Li and K. Pingali. A singular loop transformation framework based on non-singular matrices. International Journal on Parallel Processing, 22(2), April 1994.
19. Lee-Chung Lu. A unified framework for systematic loop transformations. In Proceedings of the 3rd Annual ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 28-38, 1991.
20. J. Mellor-Crummey, D. Whalley, and K. Kennedy. Improving memory hierarchy performance for irregular applications. In Proceedings of the 1999 International Conference on Supercomputing, ACM SIGARCH, pages 425-433, June 20-25 1999.
21. N. Mitchell, L. Carter, and J. Ferrante. Localizing non-affine array references. In Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques, pages 192-202, October 12-16, 1999.
22. N. Mitchell, L. Carter, and J. Ferrante. A modal model of memory. In V. N. Alexandrov, J.J. Dongarra, B.A. Juliano, R.S. Renner, and C.J.K. Tan, editors, Computational Science - ICCS 2001, Lecture Notes in Computer Science. Springer, May 28-30, 2001.
23. B. Pugh and D. Wonnacott. Nonlinear array dependence analysis. Technical Report CS-TR-3372, Dept. of Computer Science, Univ. of Maryland, nov 1994.
24. W. Pugh and E. Rosser. Iteration space slicing for locality. In Proceedings of the 12th Workshop on Languages and Compilers for Parallel Computing (LCPC), August 1999.
25. L. Rauchwerger, N. M. Amato and D. A. Padua. Run-time methods for parallelizing partially parallel loops. In Proceedings of the 1995 ACM International Conference on Supercomputing, 1995.
26. S. Rus, L. Rauchwerger, and J. Hoeflinger. Hybrid analysis: Static & dynamic memory reference analysis. In Proceedings of the 16th Annual ACM International Conference on Supercomputing, June 2002.
27. V. Sarkar and R. Thekkath. A general framework for iteration-reordering loop transformations. In Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, ACM SIGPLAN Notices, pages 175-187, June 1992.
28. J. P. Singh, C. Holt, T. Totsuka, A. Gupta, and J. Hennessy. Load balancing and data locality in adaptive hierarchical N-body methods: Barnes-Hut, fast multipole, and radiosity. Journal of Parallel and Distributed Computing, 27(2):118-141, June 1995.
29. M. M. Strout, L. Carter, and J. Ferrante. Rescheduling for locality in sparse matrix computations. In V.N. Alexandrov, J.J. Dongarra, B.A. Juliano, R.S. Renner, and C.J.K. Tan, editors, Computational Science - ICCS 2001, Lecture Notes in Computer Science. Springer, May 28-30, 2001.
30. M. M. Strout, L. Carter, J. Ferrante, J. Freeman, and B. Kreaseck. Combining performance aspects of irregular gauss-seidel via sparce tiling. In Proceedings of the 15th Workshop on Languages and Compilers for Parallel Computing (LCPC), July 2002.
31. W. Thies, F. Vivien, J. Sheldon, and S. Amarasinghe. A unified framework for schedule and storage optimization. In Proceedings of the ACM SIGPLAN '01 Conference on Programming Language Design and Implementation, ACM SIGPLAN Notices, pages 232-242, June 2001.
32. M. E. Wolf, D. E. Maydan, and D. Chen. Combining loop transformations considering caches and scheduling. In Proceedings of the 29th Annual ACM/IEEE International Symposium on Microarchitecture, pages 274-286, December 2-4, 1996.
33. H. Yu, F. Dang, and L. Rauchwerger. Parallel reductions: An application of adaptive algorithm selection. In Proceedings of the 15th Workshop on Languages and Compilers for Parallel Computing (LCPC), July 2002.