Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Communications of the ACM - Special section on computer architecture
Ensuring Fault Tolerance of Phase-Locked Clocks
IEEE Transactions on Computers
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
A Distributed Algorithm for Fault Diagnosis in Systems with Soft Failures
IEEE Transactions on Computers
The VMP network adapter board (NAB): high-performance network communication for multiprocessors
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors
IEEE Transactions on Computers
Hardware-Assisted Software Clock Synchronization for Homogeneous Distributed Systems
IEEE Transactions on Computers
Reliable broadcast algorithms for HARTS
ACM Transactions on Computer Systems (TOCS)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Graph Theory With Applications
Graph Theory With Applications
On General Results for All-to-All Broadcast
IEEE Transactions on Parallel and Distributed Systems
On the Asymptotical Optimality of Multilayered Decentralized Consensus Protocol
IEEE Transactions on Parallel and Distributed Systems
A Hybrid Time Synchronization Implemented Through Special Ring Array for Mesh or Torus
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Dihamiltonian Decomposition of Regular Graphs with Degree Three
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
N-party BAR Transfer: motivation, definition, and challenges
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
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).