On the optimal space complexity of consensus for anonymous processes

Gelashvili, Rati

doi:10.1007/s00446-018-0331-9

On the optimal space complexity of consensus for anonymous processes

Journal Article · 23 March 2018 · Distributed Computing

DOI:https://doi.org/10.1007/s00446-018-0331-9· OSTI ID:1537687

Not provided.

Research Organization:: Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States)

Sponsoring Organization:: USDOE Office of Science (SC)

DOE Contract Number:: SC0008923

OSTI ID:: 1537687

Journal Information:: Distributed Computing, Vol. 31, Issue 4; ISSN 0178-2770

Publisher:: Springer

Country of Publication:: United States

Language:: English

References (10)

On achieving consensus using a shared memory No authors listed Proceedings of the seventh annual ACM Symposium on Principles of distributed computing - PODC '88 https://doi.org/10.1145/62546.62594		January 1988
Fast randomized consensus using shared memory No authors listed Journal of Algorithms https://doi.org/10.1016/0196-6774(90)90021-6		September 1990
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols No authors listed Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83 https://doi.org/10.1145/800221.806707		January 1983
Revisionist Simulations: A New Approach to Proving Space Lower Bounds No authors listed Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18 https://doi.org/10.1145/3212734.3212749		January 2018
On the space complexity of randomized synchronization No authors listed Journal of the ACM https://doi.org/10.1145/290179.290183		September 1998
Impossibility of distributed consensus with one faulty process No authors listed Journal of the ACM https://doi.org/10.1145/3149.214121		April 1985
Test-and-Set in Optimal Space No authors listed Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing - STOC '15 https://doi.org/10.1145/2746539.2746627		January 2015
What Can Be Implemented Anonymously? No authors listed Lecture Notes in Computer Science https://doi.org/10.1007/11561927_19		January 2005
Tight bounds for shared memory symmetric mutual exclusion problems No authors listed Proceedings of the eighth annual ACM Symposium on Principles of distributed computing - PODC '89 https://doi.org/10.1145/72981.72993		January 1989
A tight space bound for consensus No authors listed Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 https://doi.org/10.1145/2897518.2897565		January 2016

Similar Records

Modeling, analysis, and optimization of complex nuclear processes and facilities via computational methods: The HALEU process case study

Journal Article · 2023 · Progress in Nuclear Energy · OSTI ID:2367530

Garcia, Humberto E.; Patterson, Michael N.; Carlson, Reed B.

A complexity-based classification for multiprocessor synchronization

Journal Article · 2019 · Distributed Computing · OSTI ID:1801897

Ellen, Faith; Gelashvili, Rati; Shavit, Nir; +1 more

A Decentralized Primal-Dual Framework for Non-Convex Smooth Consensus Optimization

Journal Article · 2023 · IEEE Transactions on Signal Processing · OSTI ID:2418275

Mancino-Ball, Gabriel; Xu, Yangyang; Chen, Jie

Related Subjects

Computer Science

On the optimal space complexity of consensus for anonymous processes

Citation Formats

References (10)

Similar Records

Related Subjects