Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Clock synchronization in distributed real-time systems
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Substituting for real time and common knowledge in asynchronous distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The MAFT Architecture for Distributed Fault Tolerance
IEEE Transactions on Computers - Fault-Tolerant Computing
AMp: a highly parallel atomic multicast protocol
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Simulating synchronized clocks and common knowledge in distributed systems
Journal of the ACM (JACM)
A practitioner's handbook for real-time analysis
A practitioner's handbook for real-time analysis
How to securely replicate services
ACM Transactions on Programming Languages and Systems (TOPLAS)
Preemptive priority-based scheduling: an appropriate engineering approach
Advances in real-time systems
Causal delivery protocols in real-time systems: a generic model
Real-Time Systems
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fault-Tolerant Real-Time Systems: The Problem of Replica Determinism
Fault-Tolerant Real-Time Systems: The Problem of Replica Determinism
Knowledge Consistency: A Useful Suspension of Disbelief
Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge
Knowledge and common knowledge in a distributed environment
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A synchronization strategy for a time-triggered multicluster real-time system
SRDS '95 Proceedings of the 14TH Symposium on Reliable Distributed Systems
Fault Tolerance in Safety Critical Automotive Applications: Cost of Agreement as a Limiting Factor
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Using Ravenscar to support fault-tolerant real-time applications
IRTAW '02 Proceedings of the 11th international workshop on Real-time Ada workshop
Transparent Environment for Replicated Ravenscar Applications
Ada-Europe '02 Proceedings of the 7th Ada-Europe International Conference on Reliable Software Technologies
Comparison of Physical and Software-Implemented Fault Injection Techniques
IEEE Transactions on Computers
Reliable Real-Time Communication in CAN Networks
IEEE Transactions on Computers
Replication Management in Reliable Real-Time Systems
Real-Time Systems
Towards Real-Time Fault-Tolerant CORBA Middleware
Cluster Computing
Maximizing the Robustness of TDMA Networks with Applications to TTP/C
Real-Time Systems
Opportunistic scheduling in a constraint-rich world
ACM SIGBED Review - Special issue: IEEE RTAS 2005 work-in-progress
Multithreading strategies for replicated objects
Proceedings of the 9th ACM/IFIP/USENIX International Conference on Middleware
Consensus-driven distributable thread scheduling in networked embedded systems
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Towards reliable intelligent transportation systems for e-government
EGOVIS'11 Proceedings of the Second international conference on Electronic government and the information systems perspective
The zerberus language: describing the functional model of dependable real-time systems
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Scheduling fixed-priority hard real-time tasks in the presence of faults
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
A JVM for soft-error-prone embedded systems
Proceedings of the 14th ACM SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Fault-tolerant scheduling in homogeneous real-time systems
ACM Computing Surveys (CSUR)
Hi-index | 14.99 |
Fault-tolerant real-time systems are typically based on active replication where replicated entities are required to deliver their outputs in an identical order within a given time interval. Distributed scheduling of replicated tasks, however, violates this requirement if on-line scheduling, preemptive scheduling, or scheduling of dissimilar replicated task sets is employed. This problem of inconsistent task outputs has been solved previously by coordinating the decisions of the local schedulers such that replicated tasks are executed in an identical order. Global coordination results either in an extremely high communication effort to agree on each schedule decision or in an overly restrictive execution model where on-line scheduling, arbitrary preemptions, and nonidentically replicated task sets are not allowed. To overcome these restrictions, a new method, called timed messages, is introduced. Timed messages guarantee deterministic operation by presenting consistent message versions to the replicated tasks. This approach is based on simulated common knowledge and a sparse time base. Timed messages are very effective since they neither require communication between the local scheduler nor do they restrict usage of on-line flexible scheduling, preemptions and nonidentically replicated task sets.