Abstract
Several algorithms for performing gossiping on one- and higher dimensional meshes are presented. As a routing model, we assume the practically important worm-hole routing. For one-dimensional arrays, we give a novel lower bound and an asymptotically optimal gossiping algorithm. For two-dimensional meshes, we present a simple algorithm composed of one-dimensional phases. For an important range of packet and mesh sizes, it gives clear improvements. The algorithm is analyzed theoretically, but, the achieved improvements are also convincingly demonstrated by simulations and by an implementation on the Paragon. For higher dimensional meshes, we give algorithms which are based on a generalized notion of a diagonal.
Part of this research was performed during a stay of the second author at the Max-Planck-Institute
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Barnett, M., R. Littlefield, D.G. Payne, R. van de Geijn, ‘Global Combine on Mesh Architectures with Wormhole Routing,’ Proc. 7th IPPS, pp. 13–16, IEEE, 1993.
Fraignaud, P., J.G. Peters, 'structured Communication in Torus Networks,’ Proc. 28th Hawai Conference on System Science, 1995.
Huang, Y., Ph. K. McKinley, ‘An Adaptive Global Reduction Algorithm for Wormhole-Routed 2D Mesh Networks,’ Proc. 7th SPDP, IEEE, 1995.
Juurlink, B., P.S. Rao, J.F. Sibeyn, ‘Gossiping on Meshes and Tori,’ Techn. Rep. MPI-I-96-1018, Max-Planck Institut für Informatik, Saarbrücken, Germany, 1996.
Kaufmann, M., S. Rajasekaran, J.F. Sibeyn, ‘Matching the Bisection Bound for Routing and Sorting on the Mesh,’ Proc. 4th SPAA, pp. 31–40, ACM, 1992.
Ni, L.M., Ph.K. McKinley, ‘A Survey of Wormhole Routing Techniques in Direct Networks,’ IEEE Computer, 26(2), pp. 62–76, 1993.
Peters, J.G., M. Syska, ‘Circuit-Switched Broadcasting in Torus Networks,’ IEEE Transactions on Parallel and Distributed Systems, to appear.
Reif, J., L.G. Valiant, ‘A Logarithmic Time Sort for Linear Size Networks,’ Journal of the ACM, 34(1), pp. 68–76, 1987.
Rao, P.S., Mouney, G. ‘Data Communications in Parallel Block Predictor-Corrector Methods for solving ODEs,’ Techn. Rep., LAAS-CNRS, France, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Juurlink, B.H.H., Rao, P.S., Sibeyn, J.F. (1996). Worm-hole gossiping on meshes. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_47
Download citation
DOI: https://doi.org/10.1007/3-540-61626-8_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61626-9
Online ISBN: 978-3-540-70633-5
eBook Packages: Springer Book Archive