Transforming loops to recursion for multi-level memory hierarchies

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 35, Issue 5, 2000, Pages 169-181

  Yi, Qing ^a   Adve, Vikram ^b   Kennedy, Ken ^a  

^a RICE UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144398455     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/358438.349323     Document Type: Article

References (30)

1. V. Adve and J. Mellor-Crummey. Using Integer Sets for Data-Parallel Program Analysis and Optimization. In Proceedings of the SIGPLAN '98 Conference, on Programming Language Design and Implementation, Montreal, Canada, June 1998.
2. B. Alpern, L. Carter, and J. Ferrante. Space-limited Procedures: A Methodology for Portable High-Performance. In International Working Conference on Massively Parallel Programming Models, 1995.
3. S. Carr and K. Kennedy. Blocking linear algebra codes for memory hierarchies. In Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing, Chicago, IL, Dec. 1989.
4. S. Carr and K. Kennedy. Improving the ratio of memory operations to floating-point operations in loops. ACM Transactions on Programming Languages and Systems, 16(6):1768-1810, 1994.
5. S. Carr and R. Lehoucq. Compiler blockability of dense matrix factorizations. ACM Transactions on Mathematical Software, 23(3), 1997.
6. 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.
7. S. Chatterjee, V. V. Jain, A. R. Lebeck, S. Mundhra, and M. Thottethodi. Nonlinear Array Layouts For Hierarchical Memory Systems. In Proc. 13th ACM Int'l Conference on Supercomputing, Phodes Greece, 1999.
8. S. Coleman and K. S. McKinley. Tile size selection using cache organization. In Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation, La Jolla, CA, June 1995.
9. E. Elmroth and F. Gustavson. Applying Recursion to Serial and Parallel QR Factorization Leads to Better Performance. Technical report, IBM T.J. Watson Research Center.
10. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-Oblivious Algorithms. Submitted for publication.
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. K. S. Gatlin and L. Carter. Architecture-Cognizant Divide and Conquer Algorithms. In Proc. SC99: High Performance Networking and Computing, Nov 1999.
13. F. G. Gustavson. Recursion Leads To Automatic Variable Blocking For Dense Linear-algebra Algorithms. IBM J. Res. Develop, 41(6), Nov 1997.
14. 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.
15. W. Kelly, W. Pugh, and E. Rosser. Code generation for multiple mappings. In Frontiers '95: The 5th Symposium on the Frontiers of Massively Parallel Computation, McLean, VA, Feb. 1995.
16. I. Kodukula, N. Ahmed, and K. Pingali. Data-centric multi-level blocking. In Proceedings of the SIGPLAN '97 Conference on Programming Language Design and Implementation, Las Vegas, NV, June 1997.
17. M. Lam, E. Rothberg, and M. E. Wolf. The cache performance and optimizations of blocked algorithms. In Proc. Fourth Int'l Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS-IV), Santa Clara, CA, Apr. 1991.
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. J. Mellor-Crummy and D. Whalley. MHSLM: A Configurable Simulator for Multi-level Memory Hierarchies. Technical Report TR-00-357, Rice University.
20. J. Mellor-Crummy, D. Whalley, and K. Kennedy. Improving Memory Hierarchy Performance For Irregular Applications. In Proc. 13th ACM Int'l Conference on Supercomputing, Phodes, Greece., 1999.
21. Robert D. Blumofe and Matteo Frigo and Christopher F. Joerg and Charles E. Leiserson and Keith H. Randall. An Analysis Of Dag-Consistent Distributed Shared-Memory Algorithms. In Proc. Eighth Annual ACM Symposium on Parallel Algorithms and Architectures(SPAA), Padua, Italy, June 1996.
22. E. J. Rosser. Fine Grained Analysis Of Array Computations. PhD thesis, Dept. of Computer Science, University of Maryland, Sep 1998.
23. H. Sharangpani. Intel Itanium Processor Microarchitecture Overview. Presentation at Intel Microprocessor Forum.
24. J. E. Smith and J. R. Goodman. A Study of Instruction Cache Organizations and Replacement Policies. In Proc. Tenth Annual Symposium on Computer Architecture, Stockholm, Sweden, June 1983.
25. Y. Song and Z. Li. New Tiling Techniques to Improve Cache Temporal Locality. In Proc. SIGPLAN '99 Conference on Programming Language Design and Implementation, Atlanta, GA, May 1999.
26. M. Weiser. Program Slicing. IEEE Transactions on Software Engineering, pages 352-357, July 1984.
27. William Pugh and Evan Rosser. Iteration Space Slicing And Its Application To Communication Optimization. In 11th ACM International Conference on Supercomputing, Vienna, Austria, July 1997.
28. William Pugh and Evan Rosser. Iteration Space Slicing For Locality. In LCPC 99, July 1999.
29. M. E. Wolf and M. Lam. A data locality optimizing algorithm. In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation, Toronto, Canada, June 1991.
30. M. J. Wolfe. More iteration space tiling. In Proceedings of Supercomputing '89, Reno, NV, Nov. 1989.