Skip to main content
Log in

Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions

  • Published:
Distributed Computing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Summary.

We present a simple and efficient wait-free implementation of Lazy Large Load-Linked/Store-Conditional (Lazy-LL/SC), which can be used to atomically modify a dynamically-determined set of shared variables in a lock-free manner. The semantics of Lazy-LL/SC is weaker than that of similar objects used by us previously to design lock-free and wait-free constructions, and as a result can be implemented more efficiently. However, we show that Lazy-LL/SC is strong enough to be used in existing non-blocking universal constructions and to build new ones.

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: December 2000 / Accepted: September 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Moir, M. Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions. Distrib Comput 14, 193–204 (2001). https://doi.org/10.1007/s004460100063

Download citation

  • Issue Date:

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