Abstract
The performance of the MPI’s collective communications is critical in most MPI-based applications. A general algorithm for a given collective communication operation may not give good performance on all systems due to the differences in architectures, network parameters and the storage capacity of the underlying MPI implementation. Hence, collective communications have to be tuned for the system on which they will be executed. In order to determine the optimum parameters of collective communications on a given system in a time-efficient manner, the collective communications need to be modeled efficiently. In this paper, we discuss various techniques for modeling collective communications.
This work was supported by the US Department of Energy through contract numberDE-FG02-99ER25378.
Chapter PDF
References
Thilo Kielmann, Henri E. Bal and Segei Gorlatch. Bandwidth-efficient Collective Communication for Clustered Wide Area Systems. IPDPS 2000, Cancun, Mexico. ( May 1-5, 2000)
Lars Paul Huse. Collective Communication on Dedicated Clusters of Workstations. Proceedings of the 6th European PVM/MPI Users’ Group Meeting, Barcelona, Spain, Spetmeber 1999. p(469–476).
David Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian and T. von Eicken. LogP: Towards a Realistic Model of Parallel Computation. In Proc. Symposium on Principles and Practice of Parallel Programming (PpoPP), pages 1–12, San Diego, CA (May 1993).
R. Rabenseifner. A new optimized MPI reduce algorithm. http://www.hlrs.de/structure/support/parallel computing/models/mpi/ myreduce.html (1997).
Marc Snir, Steve Otto, Steven Huss-Lederman, David Walker and Jack Dongarra. MPI-The Complete Reference. Volume 1, The MPI Core, second edition (1998).
M. Frigo. FFTW: An Adaptive Software Architecture for the FFT. Proceedings of the ICASSP Conference, page 1381, Vol. 3. (1998).
R. Clint Whaley and Jack Dongarra. Automatically Tuned Linear Algebra Software. SC98: High Performance Networking and Computing. http://www.cs.utk.edu/ rwhaley/ATL/INDEX.HTM. (1998)
L. Prylli and B. Tourancheau. “BIP: a new protocol designed for high performance networking on myrinet”. In the PC-NOW workshop, IPPS/SPDP 1998, Orlando, USA, 1998.
Debra Hensgen, Raphael Finkel and Udi Manber. Two algorithms for Barrier Synchroniztion. International Journal of Parallel Programming, Vol. 17, No. 1, 1988.
M. Beck, J. Dongarra, G. Fagg, A. Geist, P. Gray, J. Kohl, M. Migliardi, K. Moore, T. Moore, P. Papadopoulous, S. Scott, V. Sunderam “HARNESS: a next generation distributed virtual machine” ", Journal of Future Generation Computer Systems, (15), Elsevier Science B.V., 1999.
Graham E. Fagg and Jack J. Dongarra, “FT-MPI: Fault Tolerant MPI, Supporting Dynamic Applications in a Dynamic World”, Proc. of EuroPVM-MPI 2000, Lecture notes in Computer Science, Vol. 1908, pp346–353, Springer Verlag, 2000.
Graham E. Fagg, Sathish S. Vadhiyar, Jack J. Dongarra, “ACCT: Automatic Collective Communications Tuning”, Proc of EuroPVM-MPI 2000, Lecture Notes in Computer Science, Vol. 1908, pp354–361, Springer Verlag, 2000.
Sathish S. Vadhiyar, Graham E. Fagg, Jack J. Dongarra, “Automatically Tuned Collective Communications”, Proceedings of SuperComputing 2000, Dallas, Texas, Nov. 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vadhiyar, S.S., Fagg, G.E., Dongarra, J.J. (2001). Towards an Accurate Model for Collective Communications. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds) Computational Science — ICCS 2001. ICCS 2001. Lecture Notes in Computer Science, vol 2073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45545-0_14
Download citation
DOI: https://doi.org/10.1007/3-540-45545-0_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42232-7
Online ISBN: 978-3-540-45545-5
eBook Packages: Springer Book Archive