Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Determining the last process to fail
ACM Transactions on Computer Systems (TOCS)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Muteness detectors for consensus with Byzantine processes
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
BASE: using abstraction to improve fault tolerance
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Unreliable Intrusion Detection in Distributed Computations
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Consensus service: a modular approach for building agreement protocols in distributed systems
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
The design, analysis, and verification of the SIFT fault tolerant system
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Lower Bound on the Number of Rounds for Consensus with Dependent Process Failures
Lower Bound on the Number of Rounds for Consensus with Dependent Process Failures
Surviving internet catastrophes
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
The phoenix recovery system: rebuilding from the ashes of an internet catastrophe
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Optimizing Threshold Protocols in Adversarial Structures
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Dependability metrics
The virtue of dependent failures in multi-site systems
HotDep'05 Proceedings of the First conference on Hot topics in system dependability
Replication predicates for dependent-failure algorithms
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.00 |
We present a new abstraction to replace the t of n assumptionused in designing fault-tolerant algorithms. Thisabstraction models dependent process failures yet it is assimple to use as the t of n assumption. To illustrate this abstraction,we consider Consensus for synchronous systemswith both crash and arbitrary process failures. By consideringfailure correlations, we are able to reduce latency andenable the solution of Consensus for system configurationsin which it is not possible when forced to use algorithmsdesigned under the t of n assumption. We show that, ingeneral, the number of rounds required in the worst casewhen assuming crash failures is different from the numberof rounds required when assuming arbitrary failures. Thisis in contrast with the traditional result under the t of nassumption.