Brief Announcement: Tight Space Bounds for Memoryless Anonymous Consensus

Abstract : Tight Θ(n^2) bounds are known for the total step complexity of randomized algorithms for n-process consensus from registers [1]. However, there is a large gap between the best known space lower bound of Ω(sqrt(n)) registers and the Θ(n) space complexity of the best existing algorithms. We prove matching upper and lower bounds of n for the space complexity of nondeterministic solo-terminating consensus in a restricted computational model.
Document type :
Conference papers
Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing
Liste complète des métadonnées

Cited literature [3 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01207887
Contributor : Matthieu Roy <>
Submitted on : Thursday, October 1, 2015 - 2:56:46 PM
Last modification on : Monday, October 5, 2015 - 10:45:41 AM
Document(s) archivé(s) le : Saturday, January 2, 2016 - 11:15:04 AM

File

40-BA.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01207887, version 1

Collections

Citation

Leqi Zhu. Brief Announcement: Tight Space Bounds for Memoryless Anonymous Consensus. Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing. 〈hal-01207887〉

Share

Metrics

Record views

51

Files downloads

53