TY - JOUR
T1 - Bounded concurrent time-stamping
AU - Dolev, Danny
AU - Shavit, Nir
PY - 1997/4
Y1 - 1997/4
N2 - We introduce concurrent time-stamping, a paradigm that allows processes to temporally order concurrent events in an asynchronous shared-memory system. Concurrent time-stamp systems are powerful tools for concurrency control, serving as the basis for solutions to coordination problems such as mutual exclusion, ℓ-exclusion, randomized consensus, and multiwriter multireader atomic registers. Unfortunately, all previously known methods for implementing concurrent time-stamp systems have been theoretically unsatisfying since they require unbounded-size time-stamps - in other words, unbounded-size memory. This work presents the first bounded implementation of a concurrent time-stamp system, providing a modular unbounded-to-bounded transformation of the simple unbounded solutions to problems such as those mentioned above. It allows solutions to two formerly open problems, the bounded-probabilistic-consensus problem of Abrahamson and the fifo-ℓ-exclusion problem of Fischer, Lynch, Burns and Borodin, and a more efficient construction of multireader multiwriter atomic registers.
AB - We introduce concurrent time-stamping, a paradigm that allows processes to temporally order concurrent events in an asynchronous shared-memory system. Concurrent time-stamp systems are powerful tools for concurrency control, serving as the basis for solutions to coordination problems such as mutual exclusion, ℓ-exclusion, randomized consensus, and multiwriter multireader atomic registers. Unfortunately, all previously known methods for implementing concurrent time-stamp systems have been theoretically unsatisfying since they require unbounded-size time-stamps - in other words, unbounded-size memory. This work presents the first bounded implementation of a concurrent time-stamp system, providing a modular unbounded-to-bounded transformation of the simple unbounded solutions to problems such as those mentioned above. It allows solutions to two formerly open problems, the bounded-probabilistic-consensus problem of Abrahamson and the fifo-ℓ-exclusion problem of Fischer, Lynch, Burns and Borodin, and a more efficient construction of multireader multiwriter atomic registers.
KW - Atomic registers
KW - Concurrency
KW - Distributed computing
KW - Parallel computing
KW - Serialization
KW - Time-stamping
UR - http://www.scopus.com/inward/record.url?scp=0001366195&partnerID=8YFLogxK
U2 - 10.1137/S0097539790192647
DO - 10.1137/S0097539790192647
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0001366195
SN - 0097-5397
VL - 26
SP - 418
EP - 455
JO - SIAM Journal on Computing
JF - SIAM Journal on Computing
IS - 2
ER -