Perfect Failure Detection in Timed Asynchronous Systems
IEEE Transactions on Computers
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Causally ordered delivery in a hierarchical group of peer processes
Computer Communications
| Hi-index | 0.00 |
This paper presents a simple protocol that provides application processes with an approximate real-time notion. This time notion is very versatile. At one extreme, it behaves at least as virtual time (being thereby consistent with causality). At the other extreme, it behaves as real-time. More precisely, with respect to approximate real-time all scheduled events are always executed at their scheduled time. If local computations took no time, approximate real-time would always be real-time. The system facilitates the rescheduling of events to bring real-time and approximate time closer together if local computations take too much time. A time-slotted leader election protocol using the proposed approximate time notion is described.