Scaling parallel programs for multiprocessors: methodology and examples
- 1 July 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 26 (7), 42-50
- https://doi.org/10.1109/mc.1993.274941
Abstract
Models for the constraints under which an application should be scaled, including constant problem-size scaling, memory-constrained scaling, and time-constrained scaling, are reviewed. A realistic method is described that scales all relevant parameters under considerations imposed by the application domain. This method leads to different conclusions about the effectiveness and design of large multiprocessors than the naive practice of scaling only the data set size. The primary example application is a simulation of galaxies using the Barnes-Hut hierarchical N-body method.<>Keywords
This publication has 11 references indexed in Scilit:
- The directory-based cache coherence protocol for the DASH multiprocessorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Finding and exploiting parallelism in an ocean simulation program: Experience, results, and implicationsJournal of Parallel and Distributed Computing, 1992
- Scalability of parallel machinesCommunications of the ACM, 1991
- The Effect of Time Constraints on Scaled SpeedupSIAM Journal on Scientific and Statistical Computing, 1990
- Error analysis of a tree codeThe Astrophysical Journal Supplement Series, 1989
- Development of Parallel Methods for a $1024$-Processor HypercubeSIAM Journal on Scientific and Statistical Computing, 1988
- Reevaluating Amdahl's lawCommunications of the ACM, 1988
- A fast algorithm for particle simulationsJournal of Computational Physics, 1987
- Performance characteristics of tree codesThe Astrophysical Journal Supplement Series, 1987
- Validity of the single processor approach to achieving large scale computing capabilitiesPublished by Association for Computing Machinery (ACM) ,1967