The Community for Technology Leaders
Green Image
<p>The implementation of nondeterministic pairwise synchronous communication among a set of asynchronous processes is modeled as the binary interaction problem. The paperdescribes an algorithm for this problem that satisfies a strong fairness property thatguarantees freedom from process starvation. This is the first algorithm for binaryinteractions with strong fairness whose message cost and response time are independentof the total number of processes in the system. The paper also describes how the fairalgorithm may be extended to tolerate detectable fail-stop failures. Finally, we show howany solution to the dining philosophers problem can be embedded to design a fairalgorithm for binary interactions. In particular, this embedding is used to derive a fairalgorithm that can cope with undetectable fail-stop failures.</p>
Index Termsconcurrency control; synchronisation; distributed algorithms; fault tolerant computing;fault-tolerant algorithms; fair interprocess synchronization; asynchronous processes;binary interaction problem; strong fairness property; binary interactions; message cost;response time; dining philosophers problem; embedding

Y. Tsay and R. Bagrodia, "Fault-Tolerant Algorithms for Fair Interprocess Synchronization," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 737-748, 1994.
89 ms
(Ver 3.3 (11022016))