Tight Space Bounds for ℓ-Exclusion

  • Gadi Taubenfeld
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6950)

Abstract

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 ℓ-exclusion for some ℓ ≥ 2.

We resolve this longstanding open problem. For any ℓ and n, we provide a tight space bound on the number of single-writer bits required to solve ℓ-exclusion for n processes. It follows from our results that it is not possible to solve ℓ-exclusion with one single-writer bit per process, for any ℓ ≥ 2.

In an attempt to understand the inherent difference between the space complexity of mutual exclusion and that of ℓ-exclusion for ℓ ≥ 2, we define a weaker version of ℓ-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.

Keywords

Mutual Exclusion ℓ-exclusion space complexity tight bounds 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Afek, Y., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: A bounded first-in, first-enabled solution to the ℓ-exclusion problem. ACM Transactions on Programming Languages and Systems 16(3), 939–953 (1994)CrossRefGoogle Scholar
  2. 2.
    Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: Proc. 40th IEEE Symp. on Foundations of Computer Science, pp. 262–272 (October 1999)Google Scholar
  3. 3.
    Anderson, J.H., Moir, M.: Using local-spin k-exclusion algorithms to improve wait-free object implementations. Distributed Computing 11 (1997)Google Scholar
  4. 4.
    Burns, J.E.: Mutual exclusion with linear waiting using binary shared variables. SIGACT News 10(2), 42–47 (1978)CrossRefMATHGoogle Scholar
  5. 5.
    Burns, J.E., Lynch, A.N.: Mutual exclusion using indivisible reads and writes. In: 18th Annual Allerton Conference on Communication, Control and Computing, pp. 833–842 (1980)Google Scholar
  6. 6.
    Burns, J.N., Lynch, N.A.: Bounds on shared-memory for mutual exclusion. Information and Computation 107(2), 171–184 (1993)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Dijkstra, E.W.: Solution of a problem in concurrent programming control. Communications of the ACM 8(9), 569 (1965)CrossRefGoogle Scholar
  8. 8.
    Dolev, D., Gafni, E., Shavit, N.: Toward a non-atomic era: ℓ-exclusion as a test case. In: Proc. 20th ACM Symp. on Theory of Computing, pp. 78–92 (1988)Google Scholar
  9. 9.
    Fischer, M.J., Lynch, N.A., Burns, J.E., Borodin, A.: Resource allocation with immunity to limited process failure. In: Proc. 20th IEEE Symp. on Foundations of Computer Science, pp. 234–254 (October 1979)Google Scholar
  10. 10.
    Fischer, M.J., Lynch, N.A., Burns, J.E., Borodin, A.: Distributed FIFO allocation of identical resources using small shared space. ACM Trans. on Programming Languages and Systems 11(1), 90–114 (1989)CrossRefGoogle Scholar
  11. 11.
    Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2), 374–382 (1985)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Lamport, L.: On Interprocess Communication, Parts I and II. Distributed Computing 1(2), 77–101 (1986)CrossRefMATHGoogle Scholar
  13. 13.
    Lamport, L.: The mutual exclusion problem: Part II – statement and solutions. Journal of the ACM 33, 327–348 (1986)CrossRefMATHGoogle Scholar
  14. 14.
    Loui, M.C., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research 4, 163–183 (1987)MathSciNetGoogle Scholar
  15. 15.
    Peterson, G.L.: New bounds on mutual exclusion problems. Technical Report TR68, University of Rochester (February 1980) (Corrected, November 1994)Google Scholar
  16. 16.
    Peterson, G.L.: Observations on ℓ-exclusion. In: 28th Annual Allerton Conference on Communication, Control and Computing, pp. 568–577 (October 1990)Google Scholar
  17. 17.
    Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming, 423 pages. Pearson / Prentice-Hall (2006) ISBN 0-131-97259-6Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Gadi Taubenfeld
    • 1
  1. 1.The Interdisciplinary CenterHerzliyaIsrael

Personalised recommendations