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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: December 2000 / Accepted: September 2001
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/s004460100063