Construct · 1 fields · 1 citations

lock-freedom: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Distributed systems

a progress guarantee for concurrent objects that some thread always completes its operation in a finite number of steps, without using locks.

In distributed systems, lock-freedom refers to a progress guarantee for concurrent objects that some thread always completes its operation in a finite number of steps, without using locks. This meaning comes from Herlihy (1993) in ACM Transactions on Programming Languages and Systems.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how lock-freedom sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

number3 fields · 6 citationsjingle · one word, three constructs operation1 fields · 1 citationsanchor · a standalone construct thread1 fields · 1 citationsanchor · a standalone construct

References

Herlihy, M. (1993). A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems, 15(5), 745-770. https://doi.org/10.1145/161468.161469

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct