Summary.
We present the first explicit, and currently simplest, randomized algorithm for two-process wait-free test-and-set. It is implemented with two 4-valued single writer single reader atomic variables. A test-and-set takes at most 11 expected elementary steps, while a reset takes exactly 1 elementary step. Based on a finite-state analysis, the proofs of correctness and expected length are compressed into one table.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: June 1991 / Accepted: March 2002
Rights and permissions
About this article
Cite this article
Tromp, J., Vitányi, P. Randomized two-process wait-free test-and-set. Distrib Comput 15, 127–135 (2002). https://doi.org/10.1007/s004460200071
Issue Date:
DOI: https://doi.org/10.1007/s004460200071