Brief Announcement: Tight Space Bounds for Memoryless Anonymous Consensus - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Brief Announcement: Tight Space Bounds for Memoryless Anonymous Consensus

Leqi Zhu
  • Function : Author

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.
Fichier principal
Vignette du fichier
40-BA.pdf (168.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01207887 , version 1 (01-10-2015)

Identifiers

  • HAL Id : hal-01207887 , version 1

Cite

Leqi Zhu. Brief Announcement: Tight Space Bounds for Memoryless Anonymous Consensus. DISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan. ⟨hal-01207887⟩

Collections

DISC2015
91 View
57 Download

Share

Gmail Facebook X LinkedIn More