Synchronizing hypercube networks in the presence of faults

DOI10.1109/12.324543MaRDI QIDQ4419784zbMATH OpenOpenAlexFDO

Authors Michael Harrington, Arun K. Somani

Publication date 1994

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.324543

zbMATH Keywords

Byzantine faultsfault tolerance

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• An Optimal Synchronizer for the Hypercube
• Synchronizing clocks in the presence of faults
• Routing in hypercube networks with a constant fraction of faulty nodes
• Subcube fault tolerance in hypercube multiprocessors
• Dynamic fault-tolerant clock synchronization

Cited in

(4)

• Making asynchronous distributed computations robust to noise
• HEX: scaling honeycombs is easier than scaling clock trees
• An Optimal Synchronizer for the Hypercube
• Making Asynchronous Distributed Computations Robust to Channel Noise

This page was built for publication: Synchronizing hypercube networks in the presence of faults

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4419784)