Abstract
Near-optimal gossiping algorithms are given for two- and higher dimensional tori. It is assumed that the amount of data each PU is contributing is so large, that start-up time may be neglected. For two-dimensional tori, an earlier algorithm achieved optimality in an intricate way, with a time-dependent routing pattern. In our algorithms, in all steps, the PUs forward the received packets in the same way.
Chapter PDF
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
Alspach, B., J-C. Bermond, D. Sotteau, ‘Decomposition into Cycles I: Hamilton Decompositions,’ Proc. Workshop Cycles and Rays, Montreal, 1990.
Aubert, J., B. Schneider, ‘Decomposition de la Somme Cartesienne d’un Cycle et de l’Union de Deux Cycles Hamiltoniens en Cycles Hamiltonien,’ Discrete Mathematics, 38, pp. 7–16, 1982.
Foregger, M.F., ‘Hamiltonian Decomposition of Products of Cycles,’ Discrete Mathematics, 24, pp. 251–260, 1978.
Meyer, U., J. F. Sibeyn, ‘Time-Independent Gossiping on Full-Port Tori,’ Techn. Rep. MPI-98-1-014, Max-Planck Inst. für Informatik, Saarbrücken, Germany, 1998.
šoch, M., P. Tvrdík, ‘Optimal Gossip in Store-and-Forward Noncombining 2-D Tori,’ Proc. 3rd International Euro-Par Conference, LNCS 1300, pp. 234–241, Springer-Verlag, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyer, U., Sibeyn, J.F. (1998). Gossiping large packets on full-port tori. In: Pritchard, D., Reeve, J. (eds) Euro-Par’98 Parallel Processing. Euro-Par 1998. Lecture Notes in Computer Science, vol 1470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057964
Download citation
DOI: https://doi.org/10.1007/BFb0057964
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64952-6
Online ISBN: 978-3-540-49920-6
eBook Packages: Springer Book Archive