Summary
The binary arbitration problem (or, the problem of mutual exclusion between two competitors) is the problem of preventing two competitors from simultaneously possessing the same token. A solution to this problem is presented together with a formal correctness proof. The solution is specific in that it combines the absence of common modifiable variables with the absence of auxiliary activities. Hence, its implementation does not require an arbiter on a lower level or a degree of concurrency of more than two. The solution is generalized for any arbitrary number of competitors by applying the binary solution in a binary arbitration tree.
Similar content being viewed by others
References
Dijkstra, E.W.: Co-operating sequential processes. In: Programming Languages pp. 43–112. (F. Genuysed) Academic Press, New York 1968
Dijkstra, E.W.: An assertional proof of a program. G.L. Peterson, EWD 779 (1981)
Peterson, G.L.: Myths about the mutual exclusion problem. Information Processing Letters 12, 4, 115–116 (1981)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kessels, J.L.W. Arbitration without common modifiable variables. Acta Informatica 17, 135–141 (1982). https://doi.org/10.1007/BF00288966
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00288966