Operating system concepts (2nd ed.)
Operating system concepts (2nd ed.)
An O(lg n) expected rounds randomized Byzantine generals protocol
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Extended impossibility results for asynchronous complete networks
Information Processing Letters
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Asynchronous Byzantine consensus
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Software structures for ultraparallel computing
Software structures for ultraparallel computing
On the minimal synchronism needed for distributed consensus
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Consensus in the presence of partial synchrony (Preliminary Version)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A General Resource Allocation Synchronization Problem
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Self-stabilizing population protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Classifying rendezvous tasks of arbitrary dimension
Theoretical Computer Science
ACM SIGACT News
A closer look at fault tolerance
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
The paper deals with achievability of fault tolerant goals in a completely asynchronous distributed system. Fischer, Lynch, and Paterson [FLP] proved that in such a system "nontrivial agreement" cannot be achieved even in the (possible) presence of a single "benign" fault. In contrast, we exhibit two pairs of goals that are achievable even in the presence of up to t