论文信息 - 4-Systolic Broadcasting in a Wrapped Butterfly Network

4-Systolic Broadcasting in a Wrapped Butterfly Network

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.

Anil M. Shende | Ganesh Narayanaswamy | Praveen Vipranarayanan

[1] Juraj Hromkovič,et al. Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping) , 1996 .

[2] H. T. Kung. Let's Design Algorithms for VLSI Systems , 1979 .

[3] Satoshi Fujita,et al. Neighbourhood Gossiping in Hypercubes , 1998, Parallel Process. Lett..

[4] Ralf Klasing,et al. Broadcasting in Butterfly and deBruijn Networks , 1994, Discret. Appl. Math..

[5] Juraj Hromkovic,et al. The Complexity of Systolic Dissemination of Information in Interconnection Networks , 1994, RAIRO Theor. Informatics Appl..

[6] Dana S. Richards,et al. Network Communication in Edge-Colored Graphs: Gossiping , 1993, IEEE Trans. Parallel Distributed Syst..

[7] Stéphane Pérennes,et al. Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols , 2004, SIAM J. Discret. Math..

[8] Stéphane Pérennes,et al. Lower bounds on systolic gossip , 1997, Proceedings 11th International Parallel Processing Symposium.

[9] Stéphane Pérennes. Lower Bounds on Broadcasting Time of de Bruijn Networks , 1996, Euro-Par, Vol. I.