Abstract
In this paper we present a 4-systolic algorithm for broadcasting, in the one-port model, in an undirected d-dimensional (d even) wrapped butterfly. We prove that the broadcast time for the algorithm is no more than 5d/2 — 2, hence making it the fastest known algorithm of this nature for broadcasting in a wrapped butterfly.
This algorithm was first proposed by Dr. André Raspaud at Université Bordeaux 1, France, conveyed to Dr. Joseph G. Peters at Simon Fraser University, Canada, and subsequently conveyed to us by Dr. Sunil Shende at Rutgers University at Camden, New Jersey, USA.
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.
References
A.L. Liestman and D. Richards. Network communication in edge-colored graphs: gossiping. In IEEE Trans. Par. Distr. Syst., pages 4:438–445. 1993.
Flammini and Perennes. Lower bounds on systolic gossip. In IPPS: 11th International Parallel Processing Symposium. IEEE Computer Society Press, 1997.
Michele Flammini and Stephane Perennes. Lower bounds on the broadcasting and gossiping time of restricted protocols. Technical Report RR-3612.
Satoshi Fujita, Stephane Perennes, and Joseph G. Peters. Neighbourhood gossiping in hypercubes. Technical report, Simon Fraser University, 1997.
J. Hromkovic, R. Klasing, D. Pardubska, W. Unger, and H. Wagener. The complexity of systolic dissemination of information in interconnection networks. In R.A.I.R.O. Theoretical Informatics and Applications, pages 28(3–4):303–342. 1994.
Juran Hromkovic, Ralf Klasing, Burkhand Monien, and Regine Peine. Dissemination of information in interconnection networks (broadcasting and gossiping). in Combinatorial Network Theory.
H.T. Kung. Let’s design algorithms for VLSI systems. In Proc. of the Caltech Conference of VLSI (CL.L. Seifz Ed.), pages 65–90, Pasadena, California, 1979.
Snehal Joshi and Praveen Vipranarayanan. Broadcasting in a wrapped butterfly network. In TechFiesta: PSG College of Technology, Coimbatore, 2001. see http://citeseer.nj.nec.com/joshi01broadcasting.html.
R. Klasing, B. Monien, R. Peine, and E. Stohr. Broadcasting in butterfly and deBruijn networks. In Discrete Applied Mathematics, pages 53(1–3):183–197. 1994.
S. Perennes. Lower bounds on broadcasting time of deBruijn networks. In 2nd Int. Euro-Par Conference, volume 1123 ofLecture notes in computer Science, pages 325–332. Springer-Verlag, 1996.
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
Narayanaswamy, G., Shende, A.M., Vipranarayanan, P. (2002). 4-Systolic Broadcasting in a Wrapped Butter.y Network. 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_10
Download citation
DOI: https://doi.org/10.1007/3-540-36385-8_10
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