Clock synchronization in distributed real-time systems
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Computer networks
The process group approach to reliable distributed computing
Communications of the ACM
Understanding the limitations of causally and totally ordered communication
SOSP '93 Proceedings of the fourteenth ACM symposium on Operating systems principles
Ordering and timeliness requirements of dependable real-time programs
Real-Time Systems - Special issue: dependability of real-time software
Causal delivery protocols in real-time systems: a generic model
Real-Time Systems
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Distributed systems (2nd Ed.)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Real-time communication in FieldBus multiaccess networks
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
Non-preemptive scheduling of messages on controller area network for real-time control applications
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
Critical causality in distributed virtual environments
Proceedings of the sixteenth workshop on Parallel and distributed simulation
Achieving Fault-Tolerant Ordered Broadcasts in CAN
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Critical causal order of events in distributed virtual environments
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
| Hi-index | 0.00 |
In any distributed system, messages must be ordered according to their cause-and-effect relation to ensure correct behavior of the system. Causal ordering is also essential for services like atomic multicast and replication. In distributed real-time systems, not only must proper causal ordering be ensured, but message deadlines must be met as well. Previous algorithms which ensure such behavior include the /spl Delta/-protocol family and the MARS approach. However, both these algorithms give large response times by delaying all messages for a fixed period of time. In this paper we show that for small- to medium-sized real-time systems (consisting of a few tens of nodes) as are commonly used for embedded applications, it becomes feasible to extend the h-protocol so that instead of delaying all messages for a fixed period, each message is delayed according to its deadline. Our algorithm requires certain message deadlines to be adjusted by the application designer and we show that for small-scale applications such as those used in embedded systems, this adjustment is feasible and can be automated by the use of proper CAD tools.