Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
A Compiler that Increases the Fault Tolerance of Asynchronous Protocols
IEEE Transactions on Computers
Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Consensus in the presence of timing uncertainty: omission and Byzantine failures (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Bounds on the time to reach agreement in the presence of timing uncertainty
Journal of the ACM (JACM)
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Time bounds for real-time process control in the presence of timing uncertainty
Information and Computation
Unifying synchronous and asynchronous message-passing models
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
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
Fast set agreement in the presence of timing uncertainty
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Tight bounds for k-set agreement
Journal of the ACM (JACM)
Time bounds for decision problems in the presence of timing uncertainty and failures
Journal of Parallel and Distributed Computing
Distributed Consensus in Semi-Synchronous Systems
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Concurrent computing and shellable complexes
DISC'10 Proceedings of the 24th international conference on Distributed computing
| Hi-index | 0.00 |
The semi-synchronous model is an important middle ground between the synchronous and the asynchronous models of distributed computing. In this model, processes can detect (timeout) when other processes fail. However, since detection is done by timing out, it incurs a cost much higher than the typical delay of messages. The paper presents a new communication primitive, TimelyAnnounced Broadcast (TAB), and uses it in algorithms for consensus and set consensus in the semi-synchronous model. Separate implementations of TAB, withstanding different types of failures, allow to derive algorithms for consensus and set consensus under crash and omission failures. The time bounds obtained by our algorithms asymptotically match, or improve, the previously known bounds.