Restructuring Fortran programs for Cedar

This paper reports on the status of the Fortran translator for the Cedar computer at the end of March, 1991. A brief description of the Cedar Fortran language is followed by a discussion of the fortran77 to Cedar Fortran parallelizer that describes the techniques currently being implemented. A collection of experiments illustrate the e ectiveness of the current implementation, and point toward new approaches to be incorporated into the system in the near future.

[1]  N. S. Barnett,et al.  Private communication , 1969 .

[2]  David J. Kuck,et al.  Time and Parallel Processor Bounds for Linear Recurrence Systems , 1975, IEEE Transactions on Computers.

[3]  David B. Loveman,et al.  Program Improvement by Source-to-Source Transformation , 1977, J. ACM.

[4]  David A. Padua,et al.  Dependence graphs and compiler optimizations , 1981, POPL '81.

[5]  David A. Padua,et al.  Advanced compiler optimizations for supercomputers , 1986, CACM.

[6]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[7]  David A. Padua,et al.  Compiler Algorithms for Synchronization , 1987, IEEE Transactions on Computers.

[8]  David A. Padua,et al.  Parcel: project for the automatic restructuring and concurrent evaluation of LISP , 1988, ICS '88.

[9]  Jay Hoeflinger,et al.  Cedar Fortran and other vector and parallel Fortran dialects , 1988, Proceedings. SUPERCOMPUTING '88.

[10]  Dennis Gannon,et al.  On the problem of optimizing data transfers for complex memory systems , 1988, ICS '88.

[11]  Michael Gerndt,et al.  SUPERB: A tool for semi-automatic MIMD/SIMD parallelization , 1988, Parallel Comput..

[12]  William H. Press,et al.  Numerical recipes : the art of scientific computing : FORTRAN version , 1989 .

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

[14]  Compiler-directed data prefetching in multiprocessors with memory hierarchies , 1990 .

[15]  Compiler-directed data prefetching in multiprocessors with memory hierarchies , 1990, ICS.

[16]  K. A. Gallivan,et al.  Parallel Algorithms for Dense Linear Algebra Computations , 1990, SIAM Rev..

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

[18]  Rudolf Eigenmann,et al.  Parallelization and performance of Conjugate Gradient algorithms on the Cedar hierarchical-memory multiprocessor , 1991, PPOPP '91.

[19]  Parallelization and Performance of Conjugate Gradient Algorithms on the Cedar Hierarchical-Memory Multiprocessor , 1991, PPOPP.

[20]  Jay Hoeeinger.  Run-time Dependence Testing by Integer Sequence Analysis , 1992 .

[21]  Manish Gupta,et al.  Demonstration of Automatic Data Partitioning Techniques for Parallelizing Compilers on Multicomputers , 1992, IEEE Trans. Parallel Distributed Syst..

[22]  Rudolf Eigenmann,et al.  Performance Analysis of Parallelizing Compilers on the Perfect Benchmarks Programs , 1992, IEEE Trans. Parallel Distributed Syst..