The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—The fault-tolerance of distributed algorithms is investigated in asynchronous message passing systems with undetectable process failures. Two specific synchronization problems are considered, the <it>dining philosophers problem</it> and the <it>binary committee coordination problem</it>. The abstraction of a <it>bounded doorway</it> is introduced as a general mechanism for achieving individual progress and good failure locality. Using it as a building block, optimal fault-tolerant algorithms are constructed for the two problems.</p>
Concurrency, distributed algorithms, fault-tolerance, lower bounds, synchronization.

A. K. Singh and M. Choy, "Localizing Failures in Distributed Synchronization," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 705-716, 1996.
80 ms
(Ver 3.3 (11022016))