TY - JOUR

T1 - Time-adaptive algorithms for synchronization

AU - Alur, Rajeev

AU - Attiya, Hagit

AU - Taubenfeld, Gadi

PY - 1997/4

Y1 - 1997/4

N2 - We consider concurrent systems in which there is an unknown upper bound on memory access time. Such a model is inherently different from the asynchronous model, where no such bound exists, and also from timing-based models, where such a bound exists and is known a priori. The appeal of our model lies in the fact that while it abstracts from implementation details, it is a better approximation of real concurrent systems than the asynchronous model. Furthermore, it is stronger than the asynchronous model, enabling us to design algorithms for problems that are unsolvable in the asynchronous model. Two basic synchronization problems, consensus and mutual exclusion, are investigated in a shared-memory environment that supports atomic read/write registers. We show that Θ(Δlog Δ/log log Δ) is an upper and lower bound on the time complexity of consensus, where Δ is the (unknown) upper bound on memory access time. For the mutual exclusion problem, we design an efficient algorithm that takes advantage of the fact that some upper bound on memory access time exists. The solutions for both problems are even more efficient in the absence of contention, in which case their time complexity is a constant.

AB - We consider concurrent systems in which there is an unknown upper bound on memory access time. Such a model is inherently different from the asynchronous model, where no such bound exists, and also from timing-based models, where such a bound exists and is known a priori. The appeal of our model lies in the fact that while it abstracts from implementation details, it is a better approximation of real concurrent systems than the asynchronous model. Furthermore, it is stronger than the asynchronous model, enabling us to design algorithms for problems that are unsolvable in the asynchronous model. Two basic synchronization problems, consensus and mutual exclusion, are investigated in a shared-memory environment that supports atomic read/write registers. We show that Θ(Δlog Δ/log log Δ) is an upper and lower bound on the time complexity of consensus, where Δ is the (unknown) upper bound on memory access time. For the mutual exclusion problem, we design an efficient algorithm that takes advantage of the fact that some upper bound on memory access time exists. The solutions for both problems are even more efficient in the absence of contention, in which case their time complexity is a constant.

KW - Consensus

KW - Distributed computing

KW - Mutual exclusion

KW - Timing-based algorithms

UR - http://www.scopus.com/inward/record.url?scp=0011587343&partnerID=8YFLogxK

U2 - 10.1137/S0097539794265244

DO - 10.1137/S0097539794265244

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0011587343

SN - 0097-5397

VL - 26

SP - 539

EP - 556

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 2

ER -