Subscribe
Issue No.05 - May (1994 vol.5)
pp: 449-458
ABSTRACT
<p>All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A goodsolution to this problem is essential for clock synchronization, distributed agreement, etc.We propose a novel solution in which the reliable broadcasts from individual nodes areinterleaved in such a manner that no two packets contend for the same link at any giventime-this type of method is particularly suited for systems which use virtual cut-throughor wormhole routing for fast communication between nodes. Our solution, called the IHCAlgorithm, can be used on a large class of regular interconnection networks includingregular meshes and hypercubes. By adjusting a parameter /spl eta/ referred to as theinterleaving distance, we can flexibly decrease the link utilization of the IHC algorithm (for normal traffic) at the expense of an increase in the time required for ATA reliablebroadcast. We compare the IHC algorithm to several other possible virtual cut-throughsolutions and a store-and-forward solution. The IHC algorithm with the minimum value of /spl eta/ is shown to be optimal in minimizing the execution time of ATA reliable broadcast when used in a dedicated mode (with no other network traffic).</p>
INDEX TERMS
Index Termsmultiprocessor interconnection networks; telecommunication network routing; all-to-allreliable broadcast; meshes; hypercubes; point-to-point interconnection networks; reliablebroadcasts; wormhole routing; IHC Algorithm; interconnection networks; regular meshes; broadcast; fault-tolerance; virtual cut-through
CITATION
S. Lee, K.G. Shin, "Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes", IEEE Transactions on Parallel & Distributed Systems, vol.5, no. 5, pp. 449-458, May 1994, doi:10.1109/71.282556