article · 1997
Automated Scalability Prediction via Data Parallel Compiler Support
Celso L. Mendes, Daniel A. Reed
Cited by 0Open access
Abstract
Despite the performance potential of multicomputers, several factors have limited their widespread adoption. Of these, performance variability is among the most significant. Execution of some programs may yield only a small fraction of peak system performance, whereas others approach the system’s theoretical performance peak. Moreover, the observed performance may change substantially as application program parameters vary. Data parallel languages, which facilitate the programming of multicomputers, increase the semantic distance between the program’s source code and its observable performance, thus aggravating the performance problem. In this paper, we propose 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 is a function of the number of processors (P), problem size (N), and other system-dependent parameters. This methodology is based on information collected at compile time. By extending an existing data parallel compiler (Fortran D95), we derive, during compilation, a symbolic model that represents the cost of each high-level program section and, inductively, of the complete program. These symbolic expressions may be simplified externally with current symbolic tools. Predicting performance of the program for a given pait (P,N) requires simply the evaluation of its corresponding cost expression. We validate our implementation by predicting scalability of a variety of loop nests, with distinct computation and communication patterns.
Cite this paper
Mendes, C. L., & Reed, D. A. (1997). Automated Scalability Prediction via Data Parallel Compiler Support. https://doi.org/10.5753/sbac-pad.1997.22635
Mendes, Celso L., and Daniel A. Reed. “Automated Scalability Prediction via Data Parallel Compiler Support.” 1997, pp. 349–64, https://doi.org/10.5753/sbac-pad.1997.22635.
Mendes, Celso L., and Daniel A. Reed. 1997. “Automated Scalability Prediction via Data Parallel Compiler Support.” https://doi.org/10.5753/sbac-pad.1997.22635.
Mendes, C.L. and Reed, D.A. (1997) ‘Automated Scalability Prediction via Data Parallel Compiler Support’. Available at: https://doi.org/10.5753/sbac-pad.1997.22635.
@article{mendes1997automated,
title = {{Automated Scalability Prediction via Data Parallel Compiler Support}},
author = {Mendes, Celso L. and Reed, Daniel A.},
pages = {349--364},
year = {1997},
doi = {10.5753/sbac-pad.1997.22635}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Title of The Design and Implementation
Zhu Song-miao · Journal of Suzhou Institute of Silk Textile Technology · 2005
Cited by 0
Compile time data transfer analysis
W. Zhang, Ernst L. Leiss · International Conference on Algorithms and Architectures for Parallel Processing · 2003
Cited by 1
Constexpr: A Great Good but Wrong Idea
Yauhen Klimiankou · Ivannikov ISPRAS Open Conference (ISPRAS) · 2019
Cited by 1
Study on NC Program Compile Technology Based on JavaCC
Jia Gui-hong · Machine Tool & Hydraulics · 2007
Cited by 0
Compiler and Runtime Optimization Techniques for Implementation Scalable Parallel Applications
Zahra Khatami · Louisiana State University · 2017
Cited by 1Open access
A software science model of compile time
Wade H. Shaw, James Howatt, Robert S. Maness et al. · IEEE Transactions on Software Engineering · 1989
Cited by 6
compilers for distributed systems
Martha W. Evens · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · 2005
Cited by 0
OpenAda: Compile-Time Reflection for Ada 95
Patrick Rogers, Andy J. Wellings · Lecture notes in computer science · 2004
Cited by 5