Abstract
We represent a set of communicating processes by a graph. The mutual exclusion problem is solved for an arbitrary connected graph. The solution is shown to be fair.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Dijkstra EW (1978) The problem of the Swiss football players. EWD 685
Martin AJ (1985) Distributed mutual exclusion on a ring of processes Sci Comput Program 5:265–276
Author information
Authors and Affiliations
Additional information
Jan L.A. van de Snepscheut received a PhD from the Eindhoven University of Technology. He was a visiting assistant professor at the California Institute of Technology, and is presently a professor of computing science at Groningen University.
Rights and permissions
About this article
Cite this article
van de Snepscheut, J.L.A. Fair mutual exclusion on a graph of processes. Distrib Comput 2, 113–115 (1987). https://doi.org/10.1007/BF01667083
Issue Date:
DOI: https://doi.org/10.1007/BF01667083