Eyal Kushilevitz
Michael O. Rabin
David Zuckerman
- AS91.H. Attiya and M. Snir. Better computing on the #nonymous ring. Journal of Algorithms, 12:204-238, June 1991. Google Scholar
Digital Library
- BFJ+82.J. E. Burns, M. J. Fischer, P. Jackson, N. A. Lynch, and G. L. Peterson. Data requirements for implementation of nprocess mutual exclusion using a single shared variable. JA CM, 29:183-205, 1982. Google ScholarDigital Library
- BO83.M. Ben-Or. Another advantage of free choice: Complete asynchronous agreement protocols. In 6th ACM Symp. on Principles of Distributed Computing, pages 27-30, August 1983. Google ScholarDigital Library
- Bra85.G. Bracha. An o(log n) expected rounds randomized byzantine generals protocol. In 17th ACM Symp. on Theory of Computing, pages 316-326, 1985. Google ScholarDigital Library
- CIL87.B. Chor, A. israeli, and M. Li. On process coordination using asynchronous hardware. In 6th ACM Syrup. on Principles of Distributed Computing, pages 86-97, August 1987. Google ScholarDigital Library
- Dij65.E. Dijkstra. Solution of a problem in concurrent programming control. CACM, 8(9):569, 1965. Google ScholarDigital Library
- FL82.M. Fischer and N. Lynch. A lower bound for the time to assure interactive consistency. IPL, 14(4):183-186, 1982.Google ScholarCross Ref
- FLP85.M.J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one family faulty process. Journal of the ACM, 32(2):374- 382, April 1985. Google ScholarDigital Library
- FM88.P. Feldman and S. Micali. Optimal algorithms for byzantine agreement. In 20th ACM Symp. on Theory of Computing, pages 148-161, 1988. Google ScholarDigital Library
- GY89.R.L. Graham and A. C. Yao. On the improbability of reaching byzantine agreements. In 21st ACM Symp. on Theory of Computing, pages 467-478, 1989. Google ScholarDigital Library
- IR81.A. Itai and M. Rodeh. The lord of the ring, or probabilistic methods for breaking symmetry in distributed networks. In Proc. 22th IEEE Syrup. on Foundations of Computer Science, pages 150- 158, Nashville, T ennesse, October 1981.Google Scholar
- KR92.E. Kushilevitz and M. O. Rabin. Randomized mutual exclusion Mgorithms revisited. In llth ACM Symp. on Principles of Distributed Computing, pages 273-285, 1992. Google ScholarDigital Library
- KY84.A. Karlin and A. C. Yao. Probabilistic lower bounds for byzantine agreement. 1984.Google Scholar
- LR81.D. Lehman and M. O. Rabin. On the advantage of free choice: A symmetric and fully distributed solution to the dining philosophers problem. In 8th POPL, pages 133-138, 1981. Google ScholarDigital Library
- Rab82.M.O. Rabin. n-process mutual exclusion with bounded waiting by 4log2 nvalued shared variable. JCSS, 25(1):66- 75, 1982.Google ScholarCross Ref
- Sai92.I. Saias. Proving probabilistic correctness statements: The case of Rabin's algorithm for mutual exclusion. In llth ACM Symp. on Principles of Distributed Computing, pages 263-272, 1992. Google ScholarDigital Library
- Yao77.A.C. Yao. Probabilistic computations: Toward a unified measure of complexity. In Proc. 18th IEEE Syrup. on Foundations of Computer Science, pages 222- 227, 1977.Google Scholar
Index Terms
- Lower bounds for randomized mutual exclusion
Recommendations
Randomized mutual exclusion with sub-logarithmic RMR-complexity
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references (RMRs) metric. Attiya, Hendler, and Woelfel (40th STOC, 2008) established ...
Lower Bounds for Randomized Mutual Exclusion
We establish, for the first time, lower bounds for randomized mutual exclusion algorithms (with a read-modify-write operation). Our main result is that a constant-size shared variable cannot guarantee strong fairness, even if randomization is allowed. ...
Randomized mutual exclusion in O(log N / log log N) RMRs
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computingMutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references (RMRs) metric. A recent proof [9] established an Ω(log N) lower bound on ...
Comments