Array privatization for parallel execution of loops

In recent experiments, array privatization played a critical role in successful parallelization of several real programs. This paper presents compiler algorithms for the program analysis for this transformation. The paper also addresses issues in the implementation.

[1]  David A. Padua,et al.  Restructuring Fortran programs for Cedar , 1993, Concurr. Pract. Exp..

[2]  David A. Padua,et al.  Experience in the Automatic Parallelization of Four Perfect-Benchmark Programs , 1991, LCPC.

[3]  Thomas R. Gross,et al.  Structured dataflow analysis for arrays and its use in an optimizing compiler , 1990, Softw. Pract. Exp..

[4]  Geoffrey C. Fox,et al.  The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers , 1989, Int. J. High Perform. Comput. Appl..

[5]  Wilson C. Hsieh,et al.  A framework for determining useful parallelism , 1988, ICS '88.

[6]  Alain Lichnewsky,et al.  Introducing symbolic problem solving techniques in the dependence testing phases of a vectorizer , 1988, ICS '88.

[7]  P. Feautrier.  Array expansion , 1988 .

[8]  Paul Feautrier,et al.  Direct parallelization of call statements , 1986, SIGPLAN '86.

[9]  Barry K. Rosen,et al.  High-level data flow analysis , 1977, CACM.

[10]  J. Cocke.  Global common subexpression elimination , 1970, Symposium on Compiler Optimization.

[11]  Thomas Fahringer,et al.  An Effectiveness Study of Parallelizing Compiler Techniques , 1991, ICPP.

[12]  Utpal Banerjee,et al.  Dependence analysis for supercomputing , 1988, The Kluwer international series in engineering and computer science.

[13]  Ron Cytron,et al.  What's In a Name? -or- The Value of Renaming for Parallelism Detection and Storage Allocation , 1987, ICPP.

[14]  Frances E. Allen,et al.  Control-flow analysis , 2022 .