Computing with Infinitely Many Processes

under assumptions on concurrency and participation (Extended abstract)
  • Michael Merritt
  • Gadi Taubenfeld
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1914)


We explore four classic problems in concurrent computing (election, mutual exclusion, consensus, and naming) when the number of processes which may participate is infinite. Partial information about the number of actually participating processes and the concurrency level is shown to affect the possibility and complexity of solving these problems. We survey and generalize work carried out in models with finite bounds on the number of processes, and prove several new results. These include improved bounds for election when participation is required and a new adaptive algorithm for star vat ion-free mutual exclusion in a model with unbounded concurrency. We also explore models where objects stronger than atomic registers, such as test&set bits, semaphores or read-modify- write registers, are used.


Operating System Communication Network Problem Complexity Algorithm Analysis Classic Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [B+82]_J. E. Burns, P. Jackson, N. A. Lynch, M. J. Fischer, and G. L. Peterson. Data requirements for implementation of Af-process mutual exclusion using a single shared variable. Journal of the ACM, 29(l):183–205, 1982zbMATHCrossRefMathSciNetGoogle Scholar
  2. [BL93]
    J. N. Burns and N. A. Lynch. Bounds on shared-memory for mutual exclusion. Information and Computation, 107(2): 171–184, December 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [CS94]
    M. Choy and A.K. Singh. Adaptive solutions to the mutual exclusion problem. Distributed Computing, 8(1): 1–17, 1994.CrossRefGoogle Scholar
  4. [Dij65]
    E. W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, 1965.CrossRefGoogle Scholar
  5. [F+89]_M. J. Fischer, N. A. Lynch, J. E. Burns, and A. Borodin. Distributed FIFO allocation of identical resources using small shared space. ACM Trans, on Programming Languages and Systems, ll(l):90–114, January 1989.CrossRefGoogle Scholar
  6. [FLP85]
    M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374–382, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [FP87]
    S. A. Friedberg and G. L. Peterson. An efficient solution to the mutual exclusion problem using weak semaphores. Information Processing Letters, 25(5):343–347, 1987.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [GK98]
    E. Gafni and E. Koutsoupias. On uniform protocols., 1998.
  9. [Lam87]
    L. Lamport. A fast mutual exclusion algorithm. ACM Trans, on Computer Systems, 5(1):1–11, 1987.CrossRefGoogle Scholar
  10. [LA87]
    M. C. Loui and H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163–183, 1987.MathSciNetGoogle Scholar
  11. [MT93]
    M. Merritt and G. Taubenfeld. Speeding Lamport’s fast mutual exclusion algorithm. Information Processing Letters, 45:137–142, 1993. (Also published as an AT&T technical memorandum in May 1991.)zbMATHCrossRefGoogle Scholar
  12. [Pet94]
    G. L. Peterson. New bounds on mutual exclusion problems. Technical Report TR68, University of Rochester, February 1980 (Corrected, Nov. 1994).Google Scholar
  13. [SP89]
    E. Styer and G. L. Peterson. Tight bounds for shared memory symmetric mutual exclusion problems. In Proc. 8th PODC, pages 177–191, 1989.Google Scholar
  14. [YA94]
    J-H. Yang and J.H. Anderson. Time bounds for mutual exclusion and related problems. In Proc. 26th ACM Symp. on Theory of Computing, May 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Michael Merritt
  • Gadi Taubenfeld

There are no affiliations available

Personalised recommendations