Download:
|
by Ioana Banicescu, Mark L. Bilderback
http://www.cs.msstate.edu/~ioana/PUBLICATIONS/HPC99_gamma.ps.gz
Add To MetaCart
Abstract:
Scalability measurements of parallel applications are of significant interest to the evaluation and characterization of various parallel algorithms, particularly in scientific computing. Previously, several metrics have been proposed and accepted by the community of researchers in parallel algorithm development. However, none of these have all the attributes required by an effective metric for parallel algorithm analysis. Recently, a new performance metric has been introduced: the optimal effectiveness (\Gamma opt). It exhibits both qualitative and quantitative characteristics. This paper presents the performance evaluation of N-body simulations using the parallelized Fast Multipole Algorithm and two competing versions that include load balancing techniques. Using \Gamma opt, this paper reveals the inherent limitations of existing performance metrics and shows the advantages of employing the cost effectiveness metric for parallel applications. 1.
Citations
|
272
|
The Rapid Evaluation of Potential Fields in Particle Systems
– Greengard
- 1988
|
|
157
|
Reevaluating Amdahl’s law
– Gustafson
- 1988
|
|
130
|
Speedup versus efficiency in parallel systems
– Eager, Zahorjan, et al.
- 1989
|
|
119
|
An efficient program for many-body simulation
– Appel
- 1985
|
|
112
|
Validity of the single-processor approach to achieving large scale computing capabilities
– Amdahl
|
|
66
|
An implementation of the fast multipole method without multipoles
– Anderson
- 1992
|
|
52
|
Toward a better parallel performance metric
– Sun, Gustafson
- 1991
|
|
42
|
Performance of parallel processors
– Flatt, Kennedy
- 1989
|
|
37
|
A hierarchical O(NlogN) force calculation algo-rithm. Nature
– Barnes, Hut
- 1986
|
|
30
|
Balancing processor loads and exploiting data locality in N-body simulations
– Banicescu, Hummel
- 1995
|
|
21
|
Performance properties of large scale parallel systems. Journal of Parallel andDistributed Computing
– Gupta, Kumar
- 1993
|
|
17
|
A portable distributed implementation of the parallel multipole tree algorithm
– Rankin, Board
- 1995
|
|
16
|
Accelerated molecular dynamics simulation with the parallel fast multipole algorithm
– Board, Causey, et al.
- 1992
|
|
13
|
Load Balancing and Data Locality in the Parallelization of the Fast Multipole Algorithm
– Banicescu
- 1996
|
|
7
|
Experiences with Fractiling in N-Body Simulations
– Banicescu, Lu
- 1998
|
|
7
|
Scalable variants of multipole-based algorithms for molecular dynamics applications
– Board, Hakura, et al.
- 1995
|
|
5
|
A Parallel Adaptive Fast Multipole Algorithm
– Singh, Hotl, et al.
- 1993
|
|
4
|
Parallelization of the Fast Multipole Algorithm with Fractiling in Distributed Memory Architectures
– Lu
- 1997
|
|
4
|
The Impact of Overhead on the Scalability of Multiprocessors for Parallel Processing
– Sterling, Laprade
- 1988
|
|
3
|
Parallel multipole treecode algorithm. Anonymous FTP: egr.duke.edu
– Hakura, Elliot, et al.
- 1994
|
|
2
|
The Myth of Scalable High Performance
– Alpern, Carter
- 1995
|
|
2
|
Parallelization of the Fast Multipole Algorithm: Algorithm and Architecture
– Jr
- 1992
|
|
1
|
The Optimal Effectiveness Metric for Parallel Application Analysis
– Luke, Banicescu, et al.
- 1998
|
