Skip to main content
Log in

Randomized two-process wait-free test-and-set

  • Original article
  • Published:
Distributed Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: June 1991 / Accepted: March 2002

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004460200071

Navigation