Wait-Free Synchronization

DMCA

Wait-Free Synchronization (1993)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Maurice Herlihy

Venue:	ACM Transactions on Programming Languages and Systems
Citations:	849 - 28 self

BibTeX

@ARTICLE{Herlihy93wait-freesynchronization,
    author = {Maurice Herlihy},
    title = {Wait-Free Synchronization},
    journal = {ACM Transactions on Programming Languages and Systems},
    year = {1993},
    volume = {13},
    pages = {124--149}
}

OpenURL

Abstract

A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free implementation of one data object from another lies at the heart of much recent work in concurrent algorithms, concurrent data structures, and multiprocessor architectures. In the first part of this paper, we introduce a simple and general technique, based on reduction to a consensus protocol, for proving statements of the form "there is no wait-free implementation of X by Y ." We derive a hierarchy of objects such that no object at one level has a wait-free implementation in terms of objects at lower levels. In particular, we show that atomic read/write registers, which have been the focus of much recent attention, are at the bottom of the hierarchy: they cannot be used to construct wait-free implementations of many simple and familiar da...

Keyphrases

wait-free implementation wait-free synchronization consensus protocol first part concurrent algorithm execution speed general technique familiar da multiprocessor architecture much recent attention write register much recent work concurrent data object finite number data object concurrent data structure

DMCA