A real-time algorithm for fair interprocess synchronization
Journal
International Conference on Distributed Computing Systems
Journal Volume
1992-June
Pages
716-723
Date Issued
1992
Author(s)
Bagrodia, R.L.
Abstract
The implementation of nondeterministic pairwise synchronous communication among a set of asynchronous processes is modeled as a binary interaction problem. An algorithm for this problem, which satisfies a strong fairness property that guarantees freedom from process starvation, is described. The message and time complexities are independent of the total number of processes in the system. The ways in which the algorithm may be extended to cope with fail-stop process failures are discussed.>
SDGs
Type
conference paper