Abstract
Collective communication operations play an important role in the development of parallel programs and the efficiency of their implementation is a key factor to obtain good performances. We present in this paper efficient algorithms for the collective operations defined in the PVM programming model (i. e. reduce, broadcast, gather, scatter) [6] and we show experimental results for an industrial application gathered from an implementation based on PVMe [2].
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Bar-Noy and S. Knipis, “Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems”, Procs. of the 4th Annual ACM Symp. on Parallel Algorithms and Architectures, June 1992, pp. 11–22.
M. Bernaschi and G. Richelli, “PVMe: an enhanced implementation of PVM for the IBM 9076 SP2” Proceedings of HPCN Europe 1995, Bob Hertzberger and Giuseppe Serazzi editors, Springer, 1995
or]R.M. Karp, et al., “Optimal Broadcast and Summation in the LogP Model”, Procs. of the 5th Annual ACM Symp. on Parallel Algorithms and Architectures, June 1993, pp. 142–153.
S. Konstantinidou and E. Upfal, “Experimental Comparison of Multistage Networks”, IBM, Almaden Research Center Report RJ 8451, November 1991.
C.P. Kruskal and M.Snir, “The Performance of Multistage Interconnection Networks for Multiprocessors”, IEEE Transactions on Computers, C-32(12), Dec. 1983. “Empirical Evaluation of Randomly Wired Multistage Networks”, International Conference on Computer Design, 1990.
V.S. Sunderam, G.A. Geist, J. Dongarra and R. Manchek, “The PVM concurrent computing system: evolution, experiences and trends”, Parallel Computing, vol. 20, n. 4, April 1994.
M. Bernaschi and G. Iannello, “Quasi-Optimal Collective Communication Algorithms in LogP”, Tech. Rep., DIS, March 1995.
J. Bruck, 1. de Coster, N. Dewulf, C.T. Ho, and R. LLauwereins, “On the design and Implementation of Broadcast and global Combine Operations Using the Postal Model”, Procs. of the 6th IEEE Symp. on Parallel and Distributed Processing, 1994, pp. 594–602.
FIRE Manual Version 5.3, AVL List GmbH, 1994
P.K.W. Vinsome, ORTHOMIN, an iterative method for solving sparse sets of simultaneous linear equations, Proc. Fourth Symp. on Reservoir Simulation, Society of Petroleum Engineers of AIME, pp. 149–159, 1976
G. Bachler, R. Greimel, Parallel CFD in the Industrial Environment, Proc. Unicom Seminar, London, June 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bernaschi, M., Papetti, F., Iannello, G. (1996). Efficient collective communication operations for parallel industrial codes. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1996. Lecture Notes in Computer Science, vol 1067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61142-8_620
Download citation
DOI: https://doi.org/10.1007/3-540-61142-8_620
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61142-4
Online ISBN: 978-3-540-49955-8
eBook Packages: Springer Book Archive