Computing with infinitely many processes: Under assumptions on concurrency and participation

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

Volumn 1914, Issue , 2000, Pages 164-178

  Merritt, Michael ^a   Taubenfeld, Gadi ^b,c  

^a AT AND T LABS RESEARCH   (United States)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS;

ATOMIC REGISTER; CONCURRENT COMPUTING; MUTUAL EXCLUSIONS; NEW RESULTS; PARTIAL INFORMATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34547538473     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40026-5_11     Document Type: Conference Paper

References (13)

1. J. E. Bums, P. Jackson, N. A. Lynch, M. J. Fischer, and G. L. Peterson. Data requirements for implementation of iV-process mutual exclusion using a single shared variable. Journal of the ACM, 29(l):183-205, 1982.
2. J. N. Bums and N. A. Lynch. Bounds on shared-memory for mutual exclusion. Information and Computation, 107(2):171-184, December 1993.
3. M. Choy and A.K. Singh. Adaptive solutions to the mutual exclusion problem. Distributed Computing, 8(1):1-17, 1994.
4. E. W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, 1965.
5. M. J. Fischer, N. A. Lynch, J. E. Bums, and A. Borodin. Distributed FIFO allocation of identical resources using small shared space. ACM Trans, on Programming Languages and 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.
6. 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.
7. E. Gafni and E. Koutsoupias. On uniform protocols. http://HHH.cs.ucla.edu/'eli/eli.html, 1998.
8. L. Lamport. A fast mutual exclusion algorithm. ACM Trans, on Computer Systems, 5(1): 1—11, 1987.
9. M. C. Loui and H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163-183, 1987.
10. 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.)
11. G. L. Peterson. New bounds on mutual exclusion problems. Technical Report TR68, University of Rochester, February 1980 (Corrected, Nov. 1994).
12. E. Styer and G. L. Peterson. Tight bounds for shared memory symmetric mu¬tual exclusion problems. In Proc. 8th PODC, pages 177-191, 1989.
13. 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