The message classification model
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
The Timewheel Group Communication System
IEEE Transactions on Computers
The Timely Computing Base Model and Architecture
IEEE Transactions on Computers
Interval-based clock synchronization with optimal precision
Information and Computation
Constructing real-time group communication middleware using the resource kernel
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Designing efficient fail-safe multitolerant systems
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.01 |
We present a framework for building fail-safe hard real-time applications on top of an asynchronous distributed system subject to communication partitions, i.e. using processors and communication facilities whose real-time delays cannot be guaranteed. The basic assumption behind our approach is that each processor has a local hardware clock that proceeds within a linear envelope ofreal-time. This allows to compute an upper bound on the actual delays incurred by a particular processing sequence or message transmission. Services and applications can use these computed bounds to detect when they cannot guarantee all their properties because of excessive delays. This allows an application to detect when to switch to a fail-safe mode.