Success And Limitations In Automatic Parallelization Of The Perfect Benchmarks Programs

iii ABSTRACT There has been much work on developing new techniques for parallelizing programs yet there has been little empirical analysis to support these techniques. This thesis attempts to close this gap by measuring and analyzing the eeectiveness of commercial parallelizing compilers on the Perfect Benchmarks TM. The speedups of these codes that result from automatic parallelization will be reported. The performance gains attributed to the individual restructuring techniques, which assist the parallelization of the codes, are also given. The successes and failures of these transformations will be analyzed. This thesis will also closely examine each code in the Perfect Benchmarks TM , so to determine why each code parallelized poorly or well. Finally, potentential improvements will be ooered. iv ACKNOWLEDGEMENTS I would like to thank my thesis advisor, Rudolf Eigenmann, for his guidance and suggestions.

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

[2]  Doreen Cheng,et al.  An evaluation of automatic and interactive parallel programming tools , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

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

[4]  A PaduaDavid,et al.  Advanced compiler optimizations for supercomputers , 1986 .

[5]  Jack J. Dongarra,et al.  Vectorizing compilers: a test suite and results , 1988, Proceedings. SUPERCOMPUTING '88.

[6]  Ding-kai Chen Pen-chung Yew.  An Empirical Study on DOACROSS Loops , 1991 .

[7]  David Padua,et al.  Machine-Independent Evaluation of Parallelizing Compilers , 1992 .

[8]  Clifford N. Arnold,et al.  Performance evaluation of three automatic vectorizer packages , 1982, ICPP.

[9]  Gyungho Lee,et al.  The Effectiveness of Automatic Restructuring on Nonnumerical Programs , 1985, ICPP.

[10]  R. N. Braswell,et al.  An evaluation of vector Fortran 200 generated by Cyber 205 and ETA-10 pre-compilation tools , 1988, Proceedings. SUPERCOMPUTING '88.

[11]  D. Padua,et al.  Experimental Evaluation of Some Data Dependence Tests (extended Abstract) , 1991 .

[12]  Alexander V. Veidenbaum,et al.  The effect of restructing compilers on program performance for high-speed computers☆ , 1985 .

[13]  Christopher Eoyang,et al.  A comparison study of automatically vectorizing Fortran compilers , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

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

[15]  David A. Padua,et al.  Cedar Fortran and Its Compiler , 1990, CONPAR.

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