Performance analysis pf parallelizing compilers on the Perfect Benchmarks programs
Authors:
- 1 November 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 3 (6) , 643-656
Abstract
The speedups of the Perfect Benchmarks codes that result from automatic parallelization are reported. The performance gains caused by individual restructuring techniques have also been measured. Specific reasons for the successes and failures of the transformations are discussed, and potential improvements that result in measurably better program performance are analyzed. The most important findings are that available restructurers often cause insignificant performance gains in real programs and that only few restructuring techniques contribute to this gain. However, it can be shown that there is potential for advancing compiler technology so that many of the most important loops in these programs can be parallelized.<>Keywords
This publication has 21 references indexed in Scilit:
- Restructuring Fortran programs for CedarConcurrency: Practice and Experience, 1993
- Automatic extraction of functional parallelism from ordinary programsIEEE Transactions on Parallel and Distributed Systems, 1992
- Scanning polyhedra with DO loops1991
- A data locality optimizing algorithm1991
- Practical dependence testing1991
- Cedar Fortrand its compilerLecture Notes in Computer Science, 1990
- More iteration space tiling1989
- Supernode partitioning1988
- A Scheme to Enforce Data Dependence on Large Multiprocessor SystemsIEEE Transactions on Software Engineering, 1987
- Advanced compiler optimizations for supercomputersCommunications of the ACM, 1986