TY - GEN

T1 - Tight space bounds for l-exclusion

AU - Taubenfeld, Gadi

N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.

PY - 2011

Y1 - 2011

N2 - The simplest deadlock-free algorithm for mutual exclusion requires only one single-writer non-atomic bit per process [4,6,13]. This algorithm is known to be space optimal [5,6]. For over 20 years now it has remained an intriguing open problem whether a similar type of algorithm, which uses only one single-writer bit per process, exists also for l-exclusion for some l ≥ 2. We resolve this longstanding open problem. For any l and n, we provide a tight space bound on the number of single-writer bits required to solve l-exclusion for n processes. It follows from our results that it is not possible to solve l-exclusion with one single-writer bit per process, for any l ≥ 2. In an attempt to understand the inherent difference between the space complexity of mutual exclusion and that of l-exclusion for l ≥ 2, we define a weaker version of l-exclusion in which the liveness property is relaxed, and show that, similarly to mutual exclusion, this weaker version can be solve using one single-writer non-atomic bit per process.

AB - The simplest deadlock-free algorithm for mutual exclusion requires only one single-writer non-atomic bit per process [4,6,13]. This algorithm is known to be space optimal [5,6]. For over 20 years now it has remained an intriguing open problem whether a similar type of algorithm, which uses only one single-writer bit per process, exists also for l-exclusion for some l ≥ 2. We resolve this longstanding open problem. For any l and n, we provide a tight space bound on the number of single-writer bits required to solve l-exclusion for n processes. It follows from our results that it is not possible to solve l-exclusion with one single-writer bit per process, for any l ≥ 2. In an attempt to understand the inherent difference between the space complexity of mutual exclusion and that of l-exclusion for l ≥ 2, we define a weaker version of l-exclusion in which the liveness property is relaxed, and show that, similarly to mutual exclusion, this weaker version can be solve using one single-writer non-atomic bit per process.

KW - Mutual Exclusion

KW - l-exclusion

KW - space complexity

KW - tight bounds

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

U2 - 10.1007/978-3-642-24100-0_8

DO - 10.1007/978-3-642-24100-0_8

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:80055026987

SN - 9783642240997

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 110

EP - 124

BT - Distributed Computing - 25th International Symposium, DISC 2011, Proceedings

T2 - 25th International Symposium on Distributed Computing, DISC 2011

Y2 - 20 September 2011 through 22 September 2011

ER -