A framework for loop distribution on limited on-chip memory processors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1781, Issue , 2000, Pages 141-156

  Wang, Lei ^a   Tembe, Waibhav ^a   Pande, Santosh ^a  

^a University of Cincinnati   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPLETION TIME; DATA TRAFFIC; DEPENDENCE ANALYSIS; GREEDY ALGORITHMS; LOOP TRANSFORMATION; ON CHIP MEMORY; PROGRAM DEPENDENCE GRAPH; QUANTITATIVE MEASURES;

PROGRAM COMPILERS;

EID: 84957036203     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46423-9_10     Document Type: Conference Paper

References (23)

1. J. Eyre and J. Bier, “DSP Processors Hit the Mainstream”, ‘COMPUTER’, 31(8):51-59, August 1998.
2. Petit, Uniform Library, Omega Library, Omega Calculater. ‘http://www.cs.umd.edu/projects/omega/index.html’
3. Texas Instruments. ‘TMS 320C5x User’s Guide.
4. Embedded Java. http://java.sun.com/products/embeddedjava/.
5. A. Sundaram and S. Pande, “Compiler Optimizations for Real Time Execution of Loops on Limited Memory Embedded Systems”, Proceedings of IEEE International Real Time Systems Symposium, Madrid, Spain, pp.154-164.
6. A. Sundaram and S. Pande, “An Efficient Data Partitioning Method for Limited Memory Embedded Systems”, 1998 ACM SIGPLAN Workshop on Languages, Compilers and Tools for Embedded Systems (in conjunction with PLDI’98), Montreal, Canada, Springer-Verlag, pp. 205-218.
7. F. Irigoin and R. Triolet,”Supernode Partitioning”. in 15th Symposium on Principles of Programming Languages (POPL XV), pages 319-329, 1988.
8. J. Ramanujam and P. Sadayappan, “Tiling Multidimensional Iteration Spaces for Multi computers.” Journal of Parallel and Distributed Computing, 16:108-120, 1992.
9. U. Banerjee, “Loop transformations for restructuring compilers”, Boston: Kluwer Academic, 1994.
10. W. Li, “Compiling for NUMA parallel machines”, Ph.D. Thesis, Cornell University, Ithaca, NY, 1993.
11. M. Wolfe, High Performance Compilers for Parallel Computing, Addison Wesley, 1996.
12. M. Wolfe, “Iteration space tiling for memory hierarchies” in Third SIAM Conference on Parallel Processing for Scientific Computing, December 1987.
13. R. Schreiber and J. Dongarra, “Automatic Blocking of Nested Loops”. Technical report, RIACS, NASA Ames Research Center, and Oak Ridge National Laboratory, May 1990.
14. I. Kodukula, N. Ahmed and K. Pingali, “Data Centric Multi-level Blocking” in ACM Programming Language Design and Implementation 1997 (PLDI’97), pp. 346-357.
15. P. Panda, A. Nicolau and N. Dutt, “Memory Organization for Improved Data Cache Performance in Embedded Processors”, Proceedings of 1996 International Symposium on System Synthesis.
16. N. Mitchell, K. Hogstedt, L. Carter and J. Ferrante, “Quantifying the Multi-level Nature of Tiling Interactions”, International Journal of Parallel Programming, Vol 26, No 6, 1998, pp. 641-670.
17. K. Cooper and T. Harvey, “Compiler Controlled Memory”, Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Oct. 3-7, 1998, San Jose, CA.
18. K. McKinley, S. Carr, and C.-W. Tseng, Improving data locality with loop transformation. ACM Transactions on Programming Languages and Systems (PLDI) 18(4):424-453, July 1996.
19. M. Wolf and M. Lam, “A data locality optimizing algorithm”, in proceedings of ACM Special Interest Group on Programming Languages (SIGPLAN) 91 Conf. Programming Language Design and Implementation(PLDI’91), pp. 44, Toronto, Canada, June 1991.
20. K. Kennedy and K. Mc Kinley, “Maximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution” in Languages and Compilers for Parallel Computing (LCPC) 1993.
21. G. Gao, R. Olsen, V. Sarkar and R. Thekkath “Collective Loop Fusion for Array Contraction” in Languages and Compilers for Parallel Computing (LCPC) 1992.
22. E. Dusterwald, R. Gupta and M. Soffa, “A Practical Data-flow Framework for Array Reference Analysis and its Application in Optimization” in ACM Programming Language Design and Implementation (PLDI) 1993 pp. 68-77.
23. R. Gupta and R. Bodik, “Array Data-Flow Analysis for Load-Store Optimizations in Superscalar Architectures,” in Eighth Annual Workshop on Languages and Compilers for Parallel Computing (LCPC) 1995. Also published in International Journal of Parallel Computing, Vol. 24, No. 6, pages 481-512, 1996.