Loop parallelization algorithms: From parallelism extraction to code generation

Parallel Computing

Volumn 24, Issue 3-4, 1998, Pages 421-444

  Boulet, Pierre ^a   Darte, Alain ^a   Silber, Georges André ^a   Vivien, Frédéric ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Automatic parallelization; Code generation; Loop fusion; Nested loops; Parallelization algorithms

Indexed keywords

CODES (SYMBOLS); COMPUTER SYSTEMS PROGRAMMING; PARALLEL PROCESSING SYSTEMS;

CODE GENERATION SCHEMES; LOOP PARALLELIZATION ALGORITHMS; LOOP TRANSFORMATIONS;

PARALLEL ALGORITHMS;

EID: 0032066690     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(98)00020-9     Document Type: Article

References (39)

1. D.F. Bacon, S.L. Graham, O.J. Sharp, Compiler transformations for high-performance computing, ACM Comput. Surveys 26 (4) (1994) .
2. Michael Wolfe, High Performance Compilers For Parallel Computing, Addison-Wesley Publishing, 1996.
3. Y.-Q. Yang, C. Ancourt, F. Irigoin, Minimal data dependence abstractions for loop transformations, Int. J. Parallel Programming 23 (4) (1995) 359-388.
4. Alain Darte, Frédéric Vivien, Parallelizing nested loops with approximation of distance vectors: a survey, Parallel Process. Lett. (1997).
5. High performance Fortran forum, high performance Fortran language specification, Technical Report 2.0, Rice University, January 1997.
6. Thomas Brandes, ADAPTOR Programmer's Guide-Version 4.0, German National Research Institute for Computer Science, March 1996.
7. J.R. Allen, K. Kennedy, Automatic translation of Fortran programs to vector form, ACM Trans. Programming Languages Syst. 9 (4) (1987) 491-542.
8. M.E. Wolf, M.S. Lam, A loop transformation theory and an algorithm to maximize parallelism, IEEE Trans. Parallel Distributed Syst. 2 (4) (1991) 452-471.
9. Alain Darte, Frédéric Vivien, Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs, Proceedings of PACT '96, IEEE Computer Society Press, Boston, MA, October 1996.
10. P. Feautrier, Some efficient solutions to the affine scheduling problem: Part II. Multidimensional time, Int. J. Parallel Programming 21 (6) (1992) 389-420.
11. Amy W. Lim, Monica S. Lam, Maximizing parallelism and minimizing synchronization with affine transforms, Proceedings of the 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 1997.
12. A.J. Bernstein, Analysis of programs for parallel processing, IEEE Trans. Electron. Comput. 15 (1966) 757-762.
13. John R. Allen, Ken Kennedy, PFC: a program to convert Fortran to parallel form, Technical Report MASC-TR82-6, Rice University, Houston, TX, USA, 1982.
14. L. Lamport, The parallel execution of DO loops, Commun. ACM 17 (2) (1974) 83-93.
15. Michael Wolfe, Optimizing Supercompilers for Supercomputers, MIT Press, Cambridge, MA, 1989.
16. François Irigoin, Rémy Triolet, Computing dependence direction vectors and dependence cones with linear systems, Technical Report ENSMP-CAI-87-E94, Ecole des Mines de Paris, Fontainebleau, France, 1987.
17. P. Feautrier, Dataflow analysis of array and scalar references, Int. J. Parallel Programming 20 (1) (1991) 23-51.
18. A. Darte, L. Khachiyan, Y. Robert, Linear scheduling is nearly optimal, Parallel Process. Lett. 1 (2) (1991) 73-81.
19. A. Darte, F. Vivien, On the optimality of Allen and Kennedy's algorithm for parallelism extraction in nested loops, J. Parallel Algorithms Applicat. 12 (1-3) (1997) 83-112, Special issue on Optimizing Compilers for Parallel Languages.
20. P. Feautrier, Some efficient solutions to the affine scheduling problem: Part I. One-dimensional time, Int. J. Parallel Programming 21 (5) (1992) 313-348.
21. Alexander Schrijver, Theory of Linear and Integer Programming, Wiley, New York, 1986.
22. Alain Darte, Georges-André Silber, Frédéric Vivien, Combining retiming and scheduling techniques for loop parallelization and loop tiling, Parallel Process. Lett. (1997) Special issue, to appear. Also available as Tech. Rep. LIP, ENS-Lyon, RR96-34.
23. Corinne Ancourt, François Irigoin, Scanning polyhedra with DO loops, Proceedings of the 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, April 1991, pp. 39-50.
24. François Irigoin, Pierre Jouvelot, Rémy Triolet, Semantical interprocedural parallelization: an overview of the PIPS project, Proceedings of the 1991 ACM International Conference on Supercomputing, Cologne, Germany, June 1991.
25. W. Pugh, A practical algorithm for exact array dependence analysis, Commun. ACM 8 (1992) 27-47.
26. Marc Le Fur, Jean-Louis Pazat, Françoise André, Commutative loop nest distribution, in: H.J. Sips (Ed.), Proc. of the Fourth Int. Workshop on Compilers for Parallel Computers, Delft, The Netherlands, December 1993, pp. 345-350.
27. J.-F. Collard, P. Feautrier, T. Risset, Construction of DO loops from systems of affine constraints, Parallel Process. Lett. 5 (3) (1995) 421-436.
28. Pierre Boulet, Michèle Dion, Code generation in Bouclettes, Proceedings of the Fifth Euromicro Workshop on Parallel and Distributed Processing, IEEE Computer Society Press, London, UK, January 1997, pp. 273-280.
29. The group of Pr. Lengauer, The loopo project, World Wide Web document, URL: http://brahms.fmi.uni-passau.de/cl/loopo/index.html.
30. P. Feautrier, Parametric integer programming, RAIRO Recherche Opèrationnelle 22 (1988) 243-268.
31. Zbigniew Chamski, Environnement logiciel de programmation d'un accélérateur de calcul parallèle, PhD Thesis, Université de Rennes, Rennes, France, 1993.
32. Wei Li, Keshav Pingali, A singular loop transformation framework based on non-singular matrices, 5th Workshop on Languages and Compilers for Parallel Computing, Yale University, August 1992, pp. 249-260.
33. J. Xue, Automatic non-unimodular transformations of loop nests, Parallel Comput. 20 (5) (1994) 711-728.
34. Jean-François Collard, Code generation in automatic parallelizers, in: Claude Girault (Ed.), Proc. Int. Conf. on Application in Parallel and Distributed Computing, IFIP WG 10.3, North Holland, April 1994, pp. 185-194.
35. Wayne Kelly, William Pugh, Evan Rosser, Code generation for multiple mappings, The 5th Symposium on Frontiers of Massively Parallel Computation, McLean, VA, February 1995, pp. 332-341.
36. William Pugh, the Omega Team, World Wide Web document, url:http://www.cs.umd.edu/projects/omega/.
37. Pierre Boulet, Alain Darte, Georges-André Silber, Frédéric Vivien, Loop parallelization algorithms: from parallelism extraction to code generation, Technical Report 97-17, LIP, ENS-Lyon, France, June 1997.
38. Kathryn S. McKinley, Ken Kennedy, Maximizing loop parallelism and improving data locality via loop fusion and distribution, in: U. Banerjee, D. Gelernter, A. Nicolau, D. Padua, (Eds.), The Sixth Annual Languages and Compiler for Parallelism Workshop, Number 768 in Lecture Notes in Computer Science, Springer-Verlag, 1993, pp. 301-320.
39. David Callahan, A global approach to detection of parallelism, PhD Thesis, Dept. of Computer Science, Rice University, March 1987.