Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes

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 good solution to this problem is essential for clock synchronization, distributedagreement, etc. We propose a novel solution in which the reliable broadcastsfrom individual nodes are interleaved in such a manner that no two packets contend for the same link at any given time-this type of method is particularlysuited for systems which use virtwl cut-through or wormhole routing for fast communicationbetween nodes. Our solution, called the IHC Algorithm, can be used on a large classof regularinterconnection networksincludingregular meshesand hypercubes.By adjusting a parameter 77 referred to as the interleaving distance, we can flexibly decrease the link utilization of the IHC algorithm (for normal traffic)at the expenseof an increasein the time required for ATA reliable broadcast. We compare the IHC algorithm to several ...

• Type: Conference
• Year: 1990
• Where: ICPP
• Authors: Sunggu Lee, Kang G. Shin
• Keywords: ATA Reliable Broadcast, Distributed And Parallel Computing, ICPP 1990, Ihc Algorithm, Reliable Broadcast