Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Atomic snapshots of shared memory
Journal of the ACM (JACM)
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Structured derivations of consensus algorithms for failure detectors
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Atomic Snapshots in O (n log n) Operations
SIAM Journal on Computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
SIAM Journal on Computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The inherent price of indulgence
Distributed Computing - Special issue: PODC 02
Timeliness, failure-detectors, and consensus performance
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A tight lower bound for k-set agreement
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
How to Solve Consensus in the Smallest Window of Synchrony
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
The extended BG-simulation and the characterization of t-resiliency
Proceedings of the forty-first annual ACM symposium on Theory of computing
A topological treatment of early-deciding set-agreement
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Brief announcement: new bounds for partially synchronous set agreement
DISC'10 Proceedings of the 24th international conference on Distributed computing
(anti-Ωx × Σz)-based k-set agreement algorithms
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Generating fast indulgent algorithms
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Tight bounds for anonymous adopt-commit objects
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Faster randomized consensus with an oblivious adversary
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The impossibility of fault-tolerant set agreement in asynchronous networks is one of the seminal results in distributed computing. The complexity of set agreement in synchronous networks has also been a significant research challenge. Real systems, however, are neither purely synchronous nor purely asynchronous. Rather, they tend to alternate between periods of synchrony and periods of asynchrony.In this paper, we analyze the complexity of set agreement in a "partially synchronous" setting, presenting the first (asymptotically) tight bound on the complexity of set agreement in such systems. We introduce a novel technique for simulating, in fault-prone asynchronous shared memory, executions of an asynchronous and failure-prone messagepassing system in which some fragments appear synchronous to some processes. We use this technique to derive a lower bound on the round complexity of set agreement in a partially synchronous system by a reduction from asynchronous wait-free set agreement. We also present an asymptotically matching algorithm that relies on a distributed asynchrony detection mechanism to decide as soon as possible during periods of synchrony.By relating environments with differing degrees of synchrony, our simulation technique is of independent interest. In particular, it allows us to obtain a new lower bound on the complexity of early deciding k-set agreement complementary to that of [12], and to re-derive the combinatorial topology lower bound of [13] in an algorithmic way.