Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
ACM Transactions on Programming Languages and Systems (TOPLAS)
Applications of Byzantine agreement in database systems
ACM Transactions on Database Systems (TODS)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Synchronization in Distributed Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Byzantine clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A new fault-tolerant algorithm for clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Experimental analysis of a triple modular redundant database system (reliability, availability, tmr)
Experimental analysis of a triple modular redundant database system (reliability, availability, tmr)
Early-delivery atomic broadcast
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Secure agreement protocols: reliable and atomic group multicast in rampart
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
A Performance Evaluation Study of Pipeline TMR Systems
IEEE Transactions on Parallel and Distributed Systems
A Transaction Replication Scheme for a Replicated Database with Node Autonomy
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Objects Shared by Byzantine Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Comparison of Database Replication Techniques Based on Total Order Broadcast
IEEE Transactions on Knowledge and Data Engineering
Objects shared by Byzantine processes
Distributed Computing
Adversarial contention resolution for simple channels
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Tight bounds for shared memory systems accessed by Byzantine processes
Distributed Computing - Special issue: DISC 03
| Hi-index | 0.00 |
A Triple Modular Redundant (TMR) system achieves high reliability by replicating data and all processing at three independent nodes. When TMR is used for database processing all nonfaulty computers must execute the same sequence of transactions, and this is ensured by a collection of processes known as schedulers. In this paper we study the implementation of efficient schedulers through analysis of various enhancements such as null transactions and message batching. The schedulers have been implemented in an experimental TMR system and the evaluation results are presented here.