The Community for Technology Leaders
RSS Icon
Issue No.10 - October (1994 vol.43)
pp: 1175-1183
<p>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.</p>
hypercube networks; synchronisation; application specific integrated circuits; fault tolerant computing; reliability; hypercube networks synchronisation; distributed networks; synchronous programs; redundant results; fault tolerant systems; fault tolerant hardware synchronization schemes; phased locked loops; multistage synchronizers; Byzantine faults; ASIC design; Proteus parallel computer system; circuit switching communication network.
M. Harrington, A.K. Somani, "Synchronizing Hypercube Networks in the Presence of Faults", IEEE Transactions on Computers, vol.43, no. 10, pp. 1175-1183, October 1994, doi:10.1109/12.324543
2183 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool