Code generation in the polytope model

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn , Issue , 1998, Pages 106-111

  Griebl, Martin ^a   Lengauer, Christian ^a   Wetzel, Christian ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC PARALLELIZATION; CODE GENERATION; HIGH QUALITY; NESTED LOOPS; PARALLELIZING COMPILER; POLYTOPE MODELS; SPACE AND TIME; STATE-OF-THE-ART METHODS;

PARALLEL ARCHITECTURES;

EID: 84936955817     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACT.1998.727179     Document Type: Conference Paper

References (20)

1. C. Ancourt and F. Irigoin. Scanning polyhedra with DO loops. In Proc. 3rd ACM SIGPLAN Symp. on Principles & Practice of Parallel Programming (PPoPP), pages 39-50. ACM Press, 1991.
2. U. Banerjee. Loop Transformations for Restructuring Compilers: The Foundations. Series on Loop Transformations for Restructuring Compilers. Kluwer, 1993.
3. Z. Chamski. Scanning polyhedra with DO loop sequences. In B. C. Sendov and I. Dimov, editors, Proc. Workshop on Parallel Architectures (WPA'92). Elsevier (North-Holland), 1992.
4. J.-F. Collard. Code generation in automatic parallelizers. In C. Girault, editor, Proc. Int. Conf. on Applications in Parallel and Distributed Computing, IFIP W.G. 10.3, pages 185-194. North-Holland, Apr. 1994.
5. A. Darte and Y. Robert. Mapping uniform loop nests onto distributed memory architectures. Parallel Computing, 20(5):679-710, May 1994.
6. A. Darte and F. Vivien. Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs. Int. J. Parallel Programming, 25(6):447-496, Dec. 1997.
7. E. W. Dijkstra and C. S. Scholten. Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer-Verlag, 1990.
8. P. Feautrier. Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time. Int. J. Parallel Programming, 21(6):389-420, Oct. 1992.
9. P. Feautrier. Automatic parallelization in the polytope model. In G.-R. Perrin and A. Darte, editors, The Data Parallel Programming Model, Lecture Notes in Computer Science 1132, pages 79-103. Springer-Verlag, 1996.
10. M. Griebl and C. Lengauer. The loop parallelizer LooPo-Announcement. In D. Sehr, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing (LCPC'96), Lecture Notes in Computer Science 1239, pages 603-604. Springer-Verlag, 1997.
11. W. Kelly, W. Pugh, and E. Rosser. Code generation for multiple mappings. Technical Report CS-TR-3317, Dept. of Computer Science, Univ. of Maryland, 1994.
12. C. Lengauer. Loop parallelization in the polytope model. In E. Best, editor, CONCUR'93, Lecture Notes in Computer Science 715, pages 398-416. Springer-Verlag, 1993.
13. W. Li and K. Pingali. A singular loop transformation framework based on non-singular matrices. Int. J. Parallel Programming, 22(2):183-205, Apr. 1994.
14. A. W. Lim and M. S. Lam. Maximizing parallelism and minimizing synchronization with affine partitions. Parallel Computing, 24(3-4):445-475, May 1998.
15. W. Pugh. Uniform techniques for loop optimization. In Proc. Int. Conf. on Supercomputing (ICS'91), pages 341-352, 1991. ACM SIGARCH, ACM Press.
16. A. Schrijver. Theory of Linear and Integer Programming. Series in Discrete Mathematics. John Wiley & Sons, 1986.
17. S. Wetzel. Automatic code generation in the polyhedron model. Master's thesis, Fakultät für Mathematik und Informatik, Universität Passau, Nov. 1995. http://www.fmi.unipassau. de/loopo/doc/wetzel-d.ps.gz.
18. M. Wolf and M. Lam. A loop transformation theory and an algorithm to maximize parallelism. IEEE Trans. on Parallel and Distributed Systems, 2(4):452-471, Oct. 1991.
19. J. Xue. Automating non-unimodular transformations of loop nests. Parallel Computing, 20(5):711-728, May 1994.
20. J. Xue. Transformations of nested loops with non-convex iteration spaces. Parallel Computing, 22(3):339-368, Mar. 1996.