Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs

International Journal of Parallel Programming

Volumn 25, Issue 6, 1997, Pages 447-496

  Darte, Alain ^a   Vivien, Frédéric ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Automatic parallelization; Dependence analysis; Loop nest; Multi dimensional schedule; Polyhedral reduced dependence graph; System of uniform recurrence equations

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; PARALLEL ALGORITHMS; VECTORS;

DEPENDENCE ANALYSIS; POLYHEDRAL REDUCED DEPENDENCE GRAPHS; UNIFORM RECURRENCE EQUATIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 0031358458     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1025168022993     Document Type: Article

References (43)

1. David F. Bacon, Susan L. Graham, and Oliver J. Sharp, Compiler Transformations for High-Performance Computing ACM Computing Surveys 26(4):345-420 (1994).
2. John R. Allen and Ken Kennedy, Automatic Translation of Fortran Programs to Vector Form, ACM Trans. Program. Lang. Sys. 9(4):491-542 (October 1987).
3. Utpal Banerjee, A Theory of Loop Permutations, in D. Gelernter, A. Nicolau, and D. Padua, (eds.), Languages and Compilers for Parallel Computing, MIT Press, (1990).
4. Michael E. Wolf and Monica S. Lam, A Loop Transformation Theory and an Algorithm to Maximize Parallelism, IEEE Trans. Parallel Distribut. Syst. 2(4):452-471 (October 1991).
5. Wayne Kelly and William Pugh, A Framework for Unifying Reordering Transformations, Technical Report CS-TR-3193, University of Maryland (April 1993).
6. Paul Feautrier, Some Efficient Solutions to the Affine Scheduling Problem, Part II: Multi-Dimensional Time, IJPP 21(6):389-420 (December 1992).
7. R. M. Karp, R. E. Miller, and S. Winograd, The Organization of Computations for Uniform Recurrence Equations, J. ACM 14(3):563-590 (July 1967).
8. Alain Darte and Frédéric Vivien, A Classification of Nested Loops Parallelization Algorithms. INRIA-IEEE Symp. on Emerging Technologies and Factory Automation IEEE Computer Society Press, pp. 217-224 (1995). Will also appear in PPL, Special issue (1997).
9. Alain Darte and Frédéric Vivien, A Classification of Nested Loops Parallelization Algorithms. INRIA-IEEE Symp. on Emerging Technologies and Factory Automation IEEE Computer Society Press, pp. 217-224 (1995). Will also appear in PPL, Special issue (1997).
10. Pierre-Yves Calland, Alain Darte, Yves Robert, and Frédéric Vivien, Plugging Anti and Output Dependence Removal Techniques into Loop Parallelization Algorithms, Parallel Computing 23(1, 2):251-266 (1997).
11. Alain Darte, Georges-André Silber, and Frédéric Vivien, Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling, Parallel Processing Letters (1997). Special issue, to appear. Also available as Technical Report LIP, ENS-Lyon, RR96-34.
12. Wolfgang Meisl, Practical Methods for Scheduling and Allocation in the Polytope Model, World Wide Web document, URL:http: brahms.fmi.uni-passau.declloopodoc.
13. Leslie Lamport, The Parallel Execution of DO Loops, Commun. ACM 17(2):83-93. (February 1974).
14. Alain Darte and Yves Robert, Constructive Methods for Scheduling Uniform Loop Nests, IEEE Trans. Parallel Distribut. Syst. 5(8):814-822 (1994).
15. Alain Darte and Yves Robert, Affine-by-Statement Scheduling of Uniform and Affine Loop Nests over Parametric Domains, J. Parallel and Distributed Computing 29:43-59 (1995).
16. Paul Feautrier, Some Efficient Solutions to the Affine Scheduling Problem, Part 1: One-Dimensional Time, IJPP 21(5):313-348 (October 1992).
17. Amy W. Lim and Monica S. Lam, Maximizing Parallelism and Minimizing Synchronization with Affine Transforms, Proc. 24th Ann. ACM SIGPLAN-SIGACT Symp. Principles of Progr. Lang. (January 1997).
18. Alain Darte, Leonid Khachiyan, and Yves Robert, Linear Scheduling is Nearly Optimal, Parallel Processing Letters 1(2):73-81 (1991).
19. Patrick Le Gouëslier d'Argence, An Asymptotically Optimal Affine Schedule on Bounded Convex Polyhedric Domains, Proc. Euro-Par '96 Parallel Processing, Vol. 1124 of LNCS. Springer-Verlag (August 1996).
20. Paul Feautrier, Dataflow Analysis of Array and Scalar References. Int. JPP 20(1):23-51 (1991).
21. Jean-François Collard, Denis Barthou, and Paul Feautrier, Fuzzy Array Dataflow Analysis, Proc. 5th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, Santa Barbara, California (July 1995).
22. Alain Darte and Frédéric Vivien, On the Optimality of Allen and Kennedy's Algorithm for Parallelism Extraction in Nested Loops, Journal of Parallel Algorithms and Applications 12(1 3):83-112 (1997). Special issue on Optimizing Compilers for Parallel Languages.
23. Alain Darte and Frédéric Vivien, Revisiting the Decomposition of Karp, Miller, and Winograd. Parallel Processing Letters 5(4):551-562 (December 1995).
24. Gene H. Golub and Charles F. Van Loan, Matrix Computations. Johns Hopkins, Second Edition (1989).
25. Jack J. Dongarra and Stanley C. Eisenstal, lud. World Wide Web document. URL: http://netlib.bell-labs.com/netlib/benchmark/index.html.
26. W. Kelly, V. Maslov, W. Pugh, E. Rosser, T. Shpeisman, and D. Wonnacott, New User Interface for Petit and Other Interfaces: User Guide, University of Maryland (June 1995).
27. Arthur J. Bernstein, Analysis of Programs for Parallel Processing. IEEE Trans. Electronic Computers 15:757-762 (October 1966).
28. John R. Allen and Ken Kennedy, PFC: A program to convert Fortran to Parallel Form, Technical Report MASC-TR82-6, Rice University, Houston, Texas, (1982).
29. Michael Wolfe, Optimizing Supercompilers for Supercomputers Ph.D. Thesis, Department of Computer Science, University of Illinois at Urbana-Champaign (October 1982).
30. Michael Wolfe, Optimizing Supercompilers for Supercomputers, MIT Press, Cambridge Massachuscttes (1989).
31. François Irigoin and Rémy Triolet, Computing Dependence Direction Vectors and Dependence Cones with Linear Systems, Technical Report ENSMP-CAI-87-E94, École des Mines de Paris, Fontainebleau, France (1987).
32. François Irigoin and Rémy Triolet, Supernode Partitioning, Proc 5th Ann. ACM Symp. Principles of Progr. Lang., San Diego, California, pp. 319-329 (January 1988).
33. François Irigoin, Pierre Jouvelot, and Rémy Triolet, Semantical Interprocedural Parallelization: An overview of the PIPS Project, Proc. ACM Int. Conf. Supercomputing, Cologne, Germany (June 1991).
34. Alexander Schrijver, Theory of Linear and Integer Programming, John Wiley and Sons, New York (1986).
35. François Irigoin and Rémy Triolet, Dependence Approximation and Global Parallel Code Generation for Nested Loops, Proc. Int. Workshop on Parallel and Distributed Algorithms (October 1988).
36. Michael Wolfe, TINY, a Loop Restructuring Research Tool, Oregon Graduate Institute of Science and Technology (December 1990).
37. Alain Darte and Frédéric Vivien, Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs, Technical Report 96-06, LIP, ENS-Lyon, France (April 1996).
38. Sailesh K. Rao, Regular Iterative Algorithms and their Implementations on Processor Arrays, Ph.D. Thesis, Stanford University (October 1985).
39. Vwani P. Roychowdhury. Derivation, Extensions and Parallel Implementation of Regular Iterative Algorithms, Ph.D. Thesis, Stanford University, December 1988.
40. S. Rao Kosaraju and Gregory F. Sullivan, Detecting Cycles in Dynamic Graphs in Polynomial Time (preliminary version), Proc. 20th Ann. ACM Sympos. Theory of Computing, pp. 398-406 (May 1988).
41. Alain Darte and Frédéric Vivien, Automatic Parallelization based on Multi-Dimensional Scheduling. Technical Report 94-24, LIP, ENS-Lyon, France (September 1994).
42. M. Gondran and M. Minoux, Graphs and Algorithms. John Wiley and Sons (1984).
43. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, Introduction to Algorithms, MIT Press (1990).