Circuit-switched broadcasting in torus networks
- 1 March 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 7 (3), 246-255
- https://doi.org/10.1109/71.491578
Abstract
In this paper we present three broadcast algorithms and lower bounds on the three main components of the broadcast time for 2-dimensional torus networks (wrap-around meshes) that use synchronous circuit-switched routing. The first algorithm is based on a recursive tiling of a torus and is optimal in terms of both phases and intermediate switch settings when the start-up time to initiate message transmissions is the dominant cost. It is the first broadcast algorithm to match the lower bound of log5 N on number of phases (where N is the number of nodes). The second and third algorithms are hybrids which combine circuit-switching with the pipelining and arc-disjoint spanning trees techniques that are commonly used to speed up store-and-forward routing. When the propagation time of messages through the network is significant, our hybrid algorithms achieve close to optimal performance in terms of phases, intermediate switch settings, and total transmission time. They are the first algorithms to achieve this performance in terms of all three parameters simultaneouslyKeywords
This publication has 15 references indexed in Scilit:
- iWarp: an integrated solution to high-speed parallel computingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Supporting systolic and memory communication in iWarpPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Methods and problems of communication in usual networksDiscrete Applied Mathematics, 1994
- Intensive hypercube communication Prearranged communication in link-bound machinesJournal of Parallel and Distributed Computing, 1990
- Performance analysis of k-ary n-cube interconnection networksIEEE Transactions on Computers, 1990
- Optimum broadcasting and personalized communication in hypercubesIEEE Transactions on Computers, 1989
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksIEEE Transactions on Computers, 1987
- The torus routing chipDistributed Computing, 1986
- Virtual cut-through: A new computer communication switching techniqueComputer Networks (1976), 1979