Title :
Localizing failures in distributed synchronization
Author :
Choy, Manhoi ; Singh, Ambuj K.
Author_Institution :
Dept. of Comput. Sci., Hong Kong Univ., Hong Kong
fDate :
7/1/1996 12:00:00 AM
Abstract :
The fault-tolerance of distributed algorithms is investigated in asynchronous message passing systems with undetectable process failures. Two specific synchronization problems are considered, the dining philosophers problem and the binary committee coordination problem. The abstraction of a bounded doorway 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
Keywords :
concurrency control; distributed algorithms; fault tolerant computing; message passing; resource allocation; synchronisation; asynchronous message passing systems; binary committee coordination problem; bounded doorway i; dining philosophers problem; distributed algorithms; distributed synchronization; fault-tolerance; good failure locality; optimal fault-tolerant algorithms; undetectable process failures; Algorithm design and analysis; Computer science; Distributed algorithms; Distributed computing; Electronic switching systems; Fault detection; Fault tolerance; Fault tolerant systems; Helium; Message passing;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
