Lower bounds for randomized mutual exclusion

SIAM Journal on Computing

Volumn 27, Issue 6, 1998, Pages 1550-1563

  Kushilevitz, Eyal ^a   Mansour, Yishay ^b,c   Rabin, Michael O ^d,e   Zuckerman, David ^f  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c IBM T J WATSON RESEARCH CENTER   (United States)

^d HARVARD UNIVERSITY   (United States)

^e HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^f University of Texas at Austin   (United States)

Author keywords

Lower bounds; Markov chains; Mutual exclusion; Randomized distributed algorithms

Indexed keywords

ALGORITHMS; MARKOV PROCESSES;

MUTUAL EXCLUSION; RANDOMIZED DISTRIBUTED ALGORITHMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0032316304     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979426513X     Document Type: Article

References (17)

1. H. ATTIYA AND M. SNIR, Better computing on the anonymous ring, J. Algorithms, 12 (1991), pp. 204-238.
2. M. BEN-OR, Another advantage of free choice: Complete asynchronous agreement protocols, in Proc. 6th ACM Symp. on Principles of Distributed Computing, 1983, pp. 27-30.
3. J. E. BURNS, M. J. FISCHER, P. JACKSON, N. A. LYNCH, AND G. L. PETERSON, Data requirements for implementation of n-process mutual exclusion using a single shared variable, J. Assoc. Comput. Mach., 29 (1982), pp. 183-205.
4. G. BRACHA, An O(log n) expected rounds randomized byzantine generals protocol, in Proc. 17th ACM Symp. on Theory of Computing, 1985, pp. 316-326.
5. B. CHOR, A. ISRAELI, AND M. LI, On process coordination using asynchronous hardware, in Proc. 6th ACM Symp. on Principles of Distributed Computing, 1987, pp. 86-97.
6. E. DIJKSTRA, Solution of a problem in concurrent programming control, Comm. ACM, 8 (1965), p. 569.
7. M. FISCHER AND N. LYNCH, A lower bound for the time to assure interactive consistency, Inform. Process. Lett., 14 (1982), pp. 183-186.
8. M. J. FISCHER, N. A. LYNCH, AND M. S. PATERSON, Impossibility of distributed consensus with one faulty process, J. Assoc. Comput. Mach., 32 (1985), pp. 374-382.
9. P. FELDMAN AND S. MICALI, Optimal algorithms for byzantine agreement, in Proc. 20th ACM Symp. on Theory of Computing, 1985, pp. 148-161.
10. R. L. GRAHAM AND A. C. YAO, On the improbability of reaching byzantine agreements, in Proc. 21st ACM Symp. on Theory of Computing, 1989, pp. 467-478.
11. A. ITAI AND M. RODEH, The lord of the ring, or probabilistic methods for breaking symmetry in distributed networks, in Proc. 22th IEEE Symp. on Foundations of Computer Science, 1981, pp. 150-158.
12. E. KUSHILEVITZ AND M. O. RABIN, Randomized mutual exclusion algorithms revisited, in Proc. 11th ACM Symp. on Principles of Distributed Computing, 1992, pp. 275-283.
13. A. KARLIN AND A. C. YAO, Probabilistic Lower Bounds for Byzantine Agreement, unpublished manuscript, 1984.
14. D. LEHMAN AND M. O. RABIN, On the advantage of free choice: A symmetric and fully distributed solution to the dining philosophers problem, in Proc. 8th ACM Symp. on Principles of Programming Languages, 1981, pp. 133-138.
15. 2 n-valued shared variable, J. Comput. System Sci., 25 (1982), pp. 66-75.
16. I. SAIAS, Proving probabilistic correctness statements: The case of Rabin's algorithm for mutual exclusion, in Proc. 11th ACM Symp. on Principles of Distributed Computing, 1992, pp. 263-272.
17. A. C. YAO, Probabilistic computations: Toward a unified measure of complexity, in Proc. 18th IEEE Symp. on Foundations of Computer Science, 1977, pp. 222-227.