Complexity of multi-dimensional loop alignment

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

Volumn 2285, Issue , 2002, Pages 179-191

  Darte, Alain ^a   Huard, Guillaume ^a  

^a UNIV LYON   (France)

Author keywords

Automatic parallelization; Complexity; Loop optimization; Program transformation; Retiming

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUTOMATIC PARALLELIZATION; COMPLEXITY; LOOP OPTIMIZATIONS; PROGRAM TRANSFORMATIONS; RETIMING;

ONE DIMENSIONAL;

EID: 84937430443     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_14     Document Type: Conference Paper

References (25)

1. J. Allen, D. Callahan, and K. Kennedy. Automatic decomposition of scientific programs for parallel execution. In PoPL’87, pages 63–76, Munich, Jan. 1987.
2. P. Boulet, A. Darte, G.-A. Silber, and F. Vivien. Loop parallelization algorithms: Fromparallelismextraction to code generation. Journal of Parallel Computing, 24(3), 1998. Special issue on Languages and Compilers for Parallel Computers.
3. J.-F. Collard, P. Feautrier, and T. Risset. Construction of DO loops fromsystems of affine constraints. Parallel Processing Letters (PPL), 5(3):421–436, Sept. 1995.
4. A. Darte. On the complexity of loop fusion. In PACT’99, pages 149–157, Newport Beach, CA, Oct. 1999.
5. A. Darte and G. Huard. Loop shifting for loop parallelization. Technical Report RR2000-22, LIP, ENS-Lyon, France, May 2000.
6. A. Darte, Y. Robert, and F. Vivien. Scheduling and Automatic Parallelization. Birkhauser, 2000. ISBN 0-8176-4149-1.
7. A. Darte, G.-A. Silber, and F. Vivien. Combining retiming and scheduling techniques for loop parallelization and loop tiling. PPL, 7(4):379–392, 1997.
8. P. Feautrier. Some efficient solutions to the affine scheduling problem, Part II. Internationl Journal of Parallel Programming, 21(6):389–420, Dec. 1992.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
10. W. Kelly and B. Pugh. Selecting affine mappings based on performance estimation. Parallel Processing Letters, 4(3):205–219, Sept. 1994.
11. W. Kelly, W. Pugh, and E. Rosser. Code generation for multiple mappings. In Frontiers of Massively Parallel Computation, pages 332–341, McLean, 1995.
12. K. Kennedy and K. S. McKinley. Loop distribution with arbitrary control flow. In Supercomputing’90, Aug. 1990.
13. L. Lamport. The parallel execution of DO loops. Communications of the ACM, 17(2):83–93, Feb. 1974.
14. C. Lang, N. Passos, and E. Sha. Polynomial-time nested loop fusion with full parallelism. In ICPP’96, volume 3, pages 9–16, Bloomingdale, IL, 1996.
15. C. E. Leiserson and J. B. Saxe. Retiming synchronous circuitry. Algorithmica, 6(1):5–35, 1991.
16. A. W. Lim and M. S. Lam. Maximizing parallelism and minimizing synchronization with affine transforms. In PoPL’97. ACM Press, Jan. 1997.
17. K. S. McKinley and K. Kennedy. Maximizing loop parallelism and improving data locality via loop fusion and distribution. LCPC’93, volume 768 of Lecture Notes in Computer Science, pages 301–320. Springer-Verlag, 1993.
18. K. Okuda. Cycle shrinking by dependence reduction. In Euro-Par’96, volume 1123 of Lecture Notes in Computer Science, pages 398–401. Springer-Verlag, 1996.
19. J. K. Peir. Program Partitioning and Synchronization on Multiprocessor Systems. PhD thesis, University of Illinois at Urbana-Champaign, 1986.
20. J. K. Peir and R. Cytron. Minimum distance: A method for partitioning recurrences for multiprocessors. IEEE Trans. on Computers, 38(8):1203–1211, Aug. 1989.
21. F. Quilleré, S. Rajopadhye, and D. Wilde. Generation of efficient nested loops from polyhedra. International Journal of Parallel Programming, 28(5):469–498, 2000.
22. R. Schreiber, S. Aditya, B. R. Rau, V. Kathail, S. Mahlke, S. Abraham, and G. Snider. High-level synthesis of nonprogrammable hardware accelerators. In Application-Specific Systems, Architectures, and Processors, pages 113–124, 2000.
23. M. E. Wolf and M. S. Lam. A loop transformation theory and an algorithm to maximize parallelism. IEEE TPDS, 2(4):452–471, Oct. 1991.
24. M. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley Publishing Company, 1996.
25. H. Zima and B. Chapman. Supercompilers for Parallel and Vector Computers. ACM Press, 1990.