-Systolic Broadcasting in a Wrapped Butterfly Network

Authors:
Ganesh Narayanaswamy;Anil M. Shende;Praveen Vipranarayanan
Affiliations:
-;-;-
Venue:
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Year:
2002

Citing 4
Cited 0

Broadcasting in butterfly and deBruijn networks

Proceedings of the international workshop on Broadcasting and gossiping 1990
Network Communication in Edge-Colored Graphs: Gossiping

IEEE Transactions on Parallel and Distributed Systems
Lower Bounds on Systolic Gossip

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Lower Bounds on Broadcasting Time of de Bruijn Networks

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I

Quantified Score

Hi-index	0.00

Visualization

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.