CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
On the Optimal Space Complexity of Consensus for Anonymous Processes
Authors
F Fich
G Giakkoupis
+4Â more
H Attiya
J Aspnes
MJ Fischer
R Guerraoui
Publication date
16 August 2015
Publisher
Doi
Cite
View
on
arXiv
Abstract
The optimal space complexity of consensus in shared memory is a decades-old open problem. For a system of
n
n
n
processes, no algorithm is known that uses a sublinear number of registers. However, the best known lower bound due to Fich, Herlihy, and Shavit requires
Ω
(
n
)
\Omega(\sqrt{n})
Ω
(
n
​
)
registers. The special symmetric case of the problem where processes are anonymous (run the same algorithm) has also attracted attention. Even in this case, the best lower and upper bounds are still
Ω
(
n
)
\Omega(\sqrt{n})
Ω
(
n
​
)
and
O
(
n
)
O(n)
O
(
n
)
. Moreover, Fich, Herlihy, and Shavit first proved their lower bound for anonymous processes, and then extended it to the general case. As such, resolving the anonymous case might be a significant step towards understanding and solving the general problem. In this work, we show that in a system of anonymous processes, any consensus algorithm satisfying nondeterministic solo termination has to use
Ω
(
n
)
\Omega(n)
Ω
(
n
)
read-write registers in some execution. This implies an
Ω
(
n
)
\Omega(n)
Ω
(
n
)
lower bound on the space complexity of deterministic obstruction-free and randomized wait-free consensus, matching the upper bound and closing the symmetric case of the open problem
Similar works
Full text
Available Versions
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1007%2F978-3-662-4...
Last time updated on 01/04/2019