The Complexity of Early Deciding Set Agreement: How can Topology help?

Authors:
Rachid Guerraoui;Bastian Pochon
Affiliations:
Distributed Programming Laboratory, EPFL, Switzerland;Distributed Programming Laboratory, EPFL, Switzerland
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 8
Cited 1

More choices allow more faults: set consensus problems in totally asynchronous systems

Information and Computation
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Unifying synchronous and asynchronous message-passing models

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability

Journal of the ACM (JACM)
Tight bounds for k-set agreement

Journal of the ACM (JACM)
On the cost of fault-tolerant consensus when there are no faults: preliminary version

ACM SIGACT News
Distributed Algorithms

Distributed Algorithms
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Brief announcement: pareto optimal solutions to consensus and set consensus

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is to pose a challenge to the experts of (algebraic) topology techniques. We present an early deciding algorithm that solves the set agreement problem, i.e., the problem which triggered research on applying topology techniques to distributed computing. We conjecture the algorithm to be optimal, and we discuss the need and challenges of applying topology techniques to prove the lower bound.