Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
ACM Transactions on Programming Languages and Systems (TOPLAS)
Clock synchronization in distributed real-time systems
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Synchronization of Fault-Tolerant Clocks in the Presence of Malicious Failures
IEEE Transactions on Computers - Fault-Tolerant Computing
Continuous clock amortization need not affect the precision of a clock synchronization algorithm
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Principal Features of the VOLTAN Family of Reliable Node Architectures for Distributed Systems
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Causal delivery protocols in real-time systems: a generic model
Real-Time Systems
CesiumSpray: a Precise and Accurate Global Time Servicefor Large-scale Systems
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part III
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
The Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
On the possibility and impossibility of achieving clock synchronization
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
TMR processing without explicit clock synchronisation
SRDS '95 Proceedings of the 14TH Symposium on Reliable Distributed Systems
A Timeout-Based Message Ordering Protocol for a Lightweight Software Implementation of TMR Systems
IEEE Transactions on Parallel and Distributed Systems
A Timeout-Based Message Ordering Protocol for a Lightweight Software Implementation of TMR Systems
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Abstract--Replicated processing with majority voting is a well-known method for achieving reliability and availability. Triple Modular Redundant (TMR) processing is the most commonly used version of that method. Replicated processing requires that the replicas reach agreement on the order in which input requests are to be processed. Almost all synchronous and deterministic ordering protocols published in the literature are time-based in the sense that they require replicas' clocks to be kept synchronized within some known bound. We present a protocol for TMR systems that is based on timeouts and does not require clocks to be kept in bounded synchronism. Our design efforts focus on keeping the ordering delays small, without an unnecessary increase in message overhead. Consequently, we are able to show that no symmetric protocol that works only with unsynchronized clocks can provide a smaller worst-case delay. We also demonstrate through analysis and experiments that our protocol is faster than a time-based one of identical message complexity in certain situations which can prevail in many application settings.