Leqi Zhu
ABSTRACT
Existing n-process randomized wait-free and obstruction-free consensus protocols from registers all use at least n registers. In 1992, it was proved that such protocols must use Ω(√n) registers. Recently, this was improved to Ω(n) registers in the anonymous setting, where processes do not have identifiers. We have recently proved that at least n-1 registers are needed, even if processes have identifiers.
- Hagit Attiya and Keren Censor. Tight bounds for asynchronous randomized consensus. J. ACM, 55(5), 2008. Google Scholar
Digital Library
- Hagit Attiya and Faith Ellen. Impossibility Results for Distributed Computing. Morgan & Claypool Publishers, 2014. Google ScholarDigital Library
- James Aspnes and Maurice Herlihy. Fast randomized consensus using shared memory. J. Algorithms, 11(3):441--461, 1990. Google ScholarDigital Library
- James Aspnes and Orli Waarts. Randomized consensus in expected o(n log(2\) n) operations per processor. SIAM J. Comput., 25(5):1024--1044, 1996. Google ScholarDigital Library
- James E. Burns and Nancy A. Lynch. Bounds on shared memory for mutual exclusion. Inf. Comput., 107(2):171--184, 1993. Google ScholarDigital Library
- Jack R. Bowman. Obstruction-free snapshot, obstruction-free consensus, and fetch-and-add modulo k. Technical Report TR2011--681, Dartmouth College, Computer Science, Hanover, NH, June 2011.Google Scholar
- Zohir Bouzid, Michel Raynal, and Pierre Sutra. Brief Announcement: Anonymous Obstruction-free (n, k)-Set Agreement with n--kGoogle Scholar
- 1 Atomic Read/Write Registers. In Proceedings of 29th International Symposium on Distributed Computing (DISC 2015), volume 9363 of LNCS, pages 668--669. Springer, 2015.Google Scholar
- Benny Chor, Amos Israeli, and Ming Li. Wait-free consensus using asynchronous hardware. SIAM J. Comput., 23(4):701--712, 1994. Google ScholarDigital Library
- Faith Ellen, Panagiota Fatourou, and Eric Ruppert. The space complexity of unbounded timestamps. Distributed Computing, 21(2):103--115, 2008.Google ScholarDigital Library
- Faith Ellen, Rati Gelashvili, Nir Shavit, and Leqi Zhu. A complexity-based hierarchy for multiprocessor synchronization. 2016. To appear in PODC '16. Google ScholarDigital Library
- Faith Ellen Fich, Maurice Herlihy, and Nir Shavit. On the space complexity of randomized synchronization. J. ACM, 45(5):843--862, 1998. A preliminary version appeared in PODC '93. Google ScholarDigital Library
- Michael J. Fischer, Nancy A. Lynch, and Mike Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374--382, 1985. Google ScholarDigital Library
- Rati Gelashvili. On the optimal space complexity of consensus for anonymous processes. In Proceedings of 29th International Symposium on Distributed Computing (DISC 2015), volume 9363 of LNCS, pages 452--466. Springer, 2015.Google ScholarDigital Library
- George Giakkoupis, Maryam Helmi, Lisa Higham, and Philipp Woelfel. An O(√n) space bound for obstruction-free leader election. In Proceedings of 27th International Symposium on Distributed Computing (DISC 2013), volume 8205 of LNCS, pages 46--60. Springer, 2013. Google ScholarDigital Library
- George Giakkoupis, Maryam Helmi, Lisa Higham, and Philipp Woelfel. Test-and-set in optimal space. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing (STOC 2015), pages 615--623, 2015. Google ScholarDigital Library
- Rachid Guerraoui and Eric Ruppert. What can be implemented anonymously? In Proceedings of 19th International Symposium on Distributed Computing (DISC 2005), volume 3724 of LNCS, pages 244--259. Springer, 2005. Google ScholarDigital Library
- Maurice Herlihy. Wait-free synchronization. ACM Trans. Program. Lang. Syst., 13(1):124--149, 1991. Google ScholarDigital Library
- Maryam Helmi, Lisa Higham, Eduardo Pacheco, and Philipp Woelfel. The space complexity of long-lived and one-shot timestamp implementations. J. ACM, 61(1):7:1--7:25, 2014. Google ScholarDigital Library
- Michael C. Loui and Hosame H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163--183, 1987.Google Scholar
- Leqi Zhu. Brief Announcement: Tight Space Bounds for Memoryless Anonymous Consensus. In Proceedings of 29th International Symposium on Distributed Computing (DISC 2015), volume 9363 of LNCS, pages 665--666. Springer, 2015.Google Scholar
- Leqi Zhu. A tight space bound for consensus. 2016. To appear in STOC '16. Google ScholarDigital Library
Index Terms
- Brief Announcement: A Tight Space Bound for Consensus
Recommendations
Brief announcement: byzantine agreement with a strong adversary in polynomial expected time
PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computingIn a paper appearing in STOC 2013, we considered Byzantine agreement in the classic asynchronous message-passing model. The adversary is adaptive: it can determine which processors to corrupt and what strategy these processors should use as the ...
Brief Announcement: Asynchronous Secure Distributed Computing with Transferrable Non-equivocation Revisited
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed ComputingIn this paper, we consider two fundamental problems in secure distributed computing, namely Asynchronous Byzantine Agreement (ABA) and Asynchronous Secure Multi-party Computation (ASMPC). Our focus is on the honest majority setting, involving a set of n ...
The Space Complexity of Consensus from Swap
Nearly thirty years ago, it was shown that \(\Omega (\sqrt {n})\) read/write registers are needed to solve randomized wait-free consensus among n processes. This lower bound was improved to n registers in 2018, which exactly matches known algorithms. ...
Comments