Synchronizing Hypercube Networks in the Presence of Faults

Authors:
M. Harrington;A. K. Somani
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1994

Citing 7
Cited 1

Synchronizing clocks in the presence of faults

Journal of the ACM (JACM)
The cosmic cube

Communications of the ACM - Special section on computer architecture
Ensuring Fault Tolerance of Phase-Locked Clocks

IEEE Transactions on Computers
Clock synchronization of a large multiprocessor system in the presence of malicious faults

IEEE Transactions on Computers
An optimal synchronizer for the hypercube

SIAM Journal on Computing
Hardware-Assisted Software Clock Synchronization for Homogeneous Distributed Systems

IEEE Transactions on Computers
Fault-Tolerant Clock Synchronization in Distributed Systems

Computer

Achieving Robustness and Minimizing Overhead in Parallel Algorithms Through Overlapped Communication/Computation

The Journal of Supercomputing - Special issue on embedded fault-tolerance systems

Quantified Score

Hi-index	14.98

Visualization

Abstract

Synchronizing distributed networks allows nodes to share resources efficiently, run synchronous programs and vote on redundant results in fault tolerant systems. Due to the low connectivity of hypercube networks, neither the fault tolerant hardware synchronization schemes, phased locked loops nor multistage synchronizers can be used without adding additional links. We describe a new hardware method developed to synchronize hypercube networks. Our analysis shows that the method can sustain one fault if the connectivity of the hypercube, n, is at least three, and it can tolerate up to m/spl ges/2 Byzantine faults as long as the connectivity of the hypercube, n, is greater than max{2m+1,3m-2). This scheme has been implemented in an ASIC design for a hypercube of dimension five. It will be used in the Proteus parallel computer system to synchronize the circuit switching communication network.