Cited By
View all- Gupta RSmolka SBhaskar S(1994)On randomization in sequential and distributed algorithmsACM Computing Surveys10.1145/174666.17466726:1(7-86)Online publication date: 1-Mar-1994
Lower bounds for randomized mutual exclusion
Pages 154 - 163
References
[1]
H. Attiya and M. Snir. Better computing on the #nonymous ring. Journal of Algorithms, 12:204-238, June 1991.
[2]
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.
[3]
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.
[4]
G. Bracha. An o(log n) expected rounds randomized byzantine generals protocol. In 17th ACM Symp. on Theory of Computing, pages 316-326, 1985.
[5]
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.
[6]
E. Dijkstra. Solution of a problem in concurrent programming control. CACM, 8(9):569, 1965.
[7]
M. Fischer and N. Lynch. A lower bound for the time to assure interactive consistency. IPL, 14(4):183-186, 1982.
[8]
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.
[9]
P. Feldman and S. Micali. Optimal algorithms for byzantine agreement. In 20th ACM Symp. on Theory of Computing, pages 148-161, 1988.
[10]
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.
[11]
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.
[12]
E. Kushilevitz and M. O. Rabin. Randomized mutual exclusion Mgorithms revisited. In llth ACM Symp. on Principles of Distributed Computing, pages 273-285, 1992.
[13]
A. Karlin and A. C. Yao. Probabilistic lower bounds for byzantine agreement. 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 8th POPL, pages 133-138, 1981.
[15]
M.O. Rabin. n-process mutual exclusion with bounded waiting by 4log2 nvalued shared variable. JCSS, 25(1):66- 75, 1982.
[16]
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.
[17]
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.
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
Information & Contributors
Information
Published In
June 1993
812 pages
Copyright © 1993 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 June 1993
Check for updates
Qualifiers
- Article
Conference
STOC93
Sponsor:
STOC93: 25th Annual ACM Symposium on the Theory of Computing
May 16 - 18, 1993
California, San Diego, USA
Acceptance Rates
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 322Total Downloads
- Downloads (Last 12 months)28
- Downloads (Last 6 weeks)5
Reflects downloads up to 10 Oct 2024
Other Metrics
Citations
Cited By
View all- Gupta RSmolka SBhaskar S(1994)On randomization in sequential and distributed algorithmsACM Computing Surveys10.1145/174666.17466726:1(7-86)Online publication date: 1-Mar-1994
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in