Daniel A. Reed
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Daniel A. Reed has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Celso L. Mendes
INPE
1 shared publication - Evgenia Smirni
University of Illinois
1 shared publication - Guoyi Wang
University of Illinois
1 shared publication - Huseyin Simitci
University of Illinois
1 shared publication - James Oly
University of Illinois
1 shared publication - Jeffrey S. Vetter
Oak Ridge National Laboratory, Oak Ridge, TN, USA
1 shared publication
Latest Publications
- 1 January 2000
- Published by Springer Nature
- p. 141-159
Performance Issues in Parallel Processing Systems
- 1 January 2000
- Published by Springer Nature
- p. 141-159
Performance Issues in Parallel Processing Systems
- 1 January 1999
- Published by Springer Nature
- p. 519-532
A framework for adaptive storage input/output on computational grids
- 1 January 1999
- Published by Springer Nature
- p. 519-532
A framework for adaptive storage input/output on computational grids
- Open Access
- 7 October 1997
- Published by Sociedade Brasileira de Computação
- p. 349-364
Automated Scalability Prediction via Data Parallel Compiler Support
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.
- 7 October 1997
- Published by Sociedade Brasileira de Computação
- p. 349-364
Open AccessAutomated Scalability Prediction via Data Parallel Compiler Support
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.
- 1 January 1997
- Published by Springer Nature
- p. 169-180
Workload characterization of input/output intensive parallel applications
- 1 January 1997
- Published by Springer Nature
- p. 169-180
Workload characterization of input/output intensive parallel applications
- 1 May 1996
- Published by Elsevier in Computer Networks and ISDN Systems
- Vol. 28 (7-11) , 1457-1468
Real-time geographic visualization of World Wide Web traffic
- 1 May 1996
- Published by Elsevier in Computer Networks and ISDN Systems
- Vol. 28 (7-11) , 1457-1468
Real-time geographic visualization of World Wide Web traffic