Issue No. 03 - March (1996 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.491578
<p><b>Abstract</b>—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 <it>phases</it> 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 log<sub>5</sub><it>N</it> on number of phases (where <it>N</it> 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 simultaneously.</p>
Broadcasting, torus networks, circuit-switched routing, tilings, pipelining.
J. G. Peters and M. Syska, "Circuit-Switched Broadcasting in Torus Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 246-255, 1996.