Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192) (1998)
Oct. 12, 1998 to Oct. 18, 1998
Celso L. Mendes , National Institute of Space Research
Daniel A. Reed , University of Illinois
Despite the performance potential of parallel systems, several factors have hindered their widespread adoption. Of these, performance variability is among the most significant. Data parallel languages, which facilitate the programming of those systems, increase the semantic distance between the program's source code and its observable performance, thus aggravating the optimization problem.In this paper, we present a new methodology to automatically predict the performance scalability of data parallel applications on multicomputers. Our technique represents the execution time of a program as a symbolic expression that includes the number of processors (P), problem size (N), and other system-dependent parameters. This methodology is strongly based on information collected at compile-time. By extending an existing data parallel compiler (Fortran D95), we derive, during compilation, a symbolic cost model that represents the expected cost of each high-level code section and, inductively, of the complete program.
Scalability Analysis, Performance Prediction, Guided Compilation
C. L. Mendes and D. A. Reed, "Integrated Compilation and Scalability Analysis for Parallel Systems," Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192)(PACT), Paris, France, 1998, pp. 385.