Abstract
We present a methodology for parallel programming, along with MPI performance measurement and prediction in a class of a distributed computing environments, namely networks of workstations. Our approach is based on a two-level model where, at the top, a new parallel version of timing graph representation is used to make explicit the parallel communication and code segments of a given parallel program, while at the bottom level, analytical models are developed to represent execution behavior of parallel communications and code segments. Execution time results obtained from execution, together with problem size and number of nodes, are input to the model, which allows us to predict the performance of similar cluster computing systems with a different number of nodes. The analytical model is validated by performing experiments over a homogeneous cluster of workstations. Final results show that our approach produces accurate predictions, within 5% of actual results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D.H. Bailey, J. T. Barton, T.A. Lasinski and H. D. Simon. The NAS parallel benchmarks. Tech. Report NASA memorandum 103863, NASA Ames Research Center, July 1993.
H.W. Cain, B.P. Miller and B.J. Wylie. A callgraph-based search strategy for automated performance diagnosis. In: Proceedings of the Euro-Par 2000, Munich, Germany, 2000.
A.J.C. van Gemund. Performance modeling of parallel systems. PhD thesis, Delft University of Technology, Delft University Press, ISBN 90-407-1326-X, 1996.
P.G. Harrison, N.M. Patel. Performance modeling of communication networks and computer architectures. Addison-Wesley, 1993.
G. Karypis, V. Kumar. Analysis of multilevel graph partitioning. Technical report 98-037, University of Minnesota, 1998.
J. Landrum, J. Hardwick and Q.F. Stout. Predicting algorithm performance. Computing Science and Statistics 30, pages 309–314, 1998.
K.C. Li. Performance analysis and prediction of parallel programs on network of workstations. Ph.D. thesis, Department of Computer Engineering and Digital Systems, University of São Paulo, 2001.
R. P. Martin et al. Effects of Communication Latency, Overhead, and Bandwidth in a Cluster Architecture. In: Proceedings of the 24th Annual International Symposium on Computer Architecture, pages 85–97, Denver, 1997.
C.L. Mendes, D.A. Reed. Performance prediction by trace transformation. In: V SBACPAD razilian Symposium on Computer Architecture-High Performance Computing, São Paulo, 1993.
N. Nupairoj, L. Ni. Performance Evaluation of Some MPI Implementations. Technical Report MSU-CPS-ACS-94, Department of Computer Science, Michigan State University, Sept. 1994.
P. Puschner, A. Schedl. Computing Maximum Task Execution Times-a graph-Based Approach. In: Journal of Real-Time Systems, vol. 13, no.1, pages 67–91, 1997.
D. F. Vrsalovic, D.P. Siewiorek, Z.Z. Segall and E.F. Gehringer. Performance prediction and calibration for a class of multiprocessors. IEEE Transactions on Computers, v. 37, n. 11, pages 1353–1364, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ching, L.K., Gaudiot, JL., Sato, L.M. (2002). Performance Prediction Methodology for Parallel Programs with MPI in NOW Environments. In: Das, S.K., Bhattacharya, S. (eds) Distributed Computing. IWDC 2002. Lecture Notes in Computer Science, vol 2571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36385-8_27
Download citation
DOI: https://doi.org/10.1007/3-540-36385-8_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00355-7
Online ISBN: 978-3-540-36385-9
eBook Packages: Springer Book Archive