Abstract:
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processors. However, deriving an explicit formula for the running time of a certain parallel program is a difficult task. We present a new method for the analysis of parallel programs: simulating the execution of parallel programs by following their control flow and by determining, for each processor, the sequence of send and receive operations according to the LogGP model. We developed two algorithms to simulate the LogGP communication between processors and we tested them on the blocked parallel version of the Gaussian Elimination algorithm on the Meiko CS-2 parallel machine. Our implementation showed that the LogGP simulation is able to detect the nonlinear behavior of the program running times, to indicate the differences in running times for different data layouts and to find the local optimal value of the block size with acceptable precision. 1
Citations
|
977
|
A Bridging Model for Parallel Computation
– Valiant
- 1990
|
|
445
|
Eicken, LogP: Towards a realistic model of parallel computation
– Culler, Karp, et al.
- 1993
|
|
397
|
Introduction to Parallel Computing: Design and Analysis of Algorithms (Redwood City, Calif.: Benjamin Cummings
– Kumar, Grama, et al.
- 1994
|
|
194
|
LogGP: incorporating long messages into the LogP model for parallel computation
– Alexandrov, Ionescu, et al.
- 1997
|
|
156
|
Parallel programming in split-c
– Culler, Arpaci-Dusseau, et al.
- 1993
|
|
59
|
Parallel Performance Prediction Using Lost Cycles Analysis
– Crovella, LeBlanc
- 1994
|
|
58
|
Optimal broadcast and summation in the logp model
– Karp, Sahay, et al.
- 1993
|
|
51
|
High-Level Optimization via Automated Statistical Modeling
– Brewer
- 1995
|
|
20
|
Models and resource metrics for parallel and distributed computation
– Li, Mills, et al.
- 1995
|
|
15
|
Accurate predictions of parallel program execution time
– Driscoll, Daasch
- 1995
|
|
14
|
Predicting the performance of large programs on scalable multicomputers
– Stramm, Berman
- 1992
|
|
8
|
A measurement-based model to predict the performance impact of system modifications: A case study
– Dimpsey, Iyer
- 1995
|
|
8
|
A layered approach to the characterization of parallel systems for performance prediction
– Nudd, Papaefstathiou, et al.
- 1993
|
|
7
|
Upper time bounds for executing PRAM-programs on the LogP-machine
– Lowe, Zimmermann
- 1995
|
|
6
|
Modeling performance of parallel programs
– Meira
- 1995
|
|
4
|
Performance estimation in a massively parallel system
– Agrawal, Chakradhar
- 1990
|
|
4
|
Solving triangular linear systems in parallel using substitution
– Santos
- 1995
|
|
3
|
Performance prediction of parallel computation
– Liang, Tripathi
- 1994
|