Approximate Real-Time Clocks for Scheduled Events
Research output: Contribution to conferences › Paper › Contributed › peer-review
Contributors
Abstract
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.
Details
| Original language | English |
|---|---|
| Number of pages | 9 |
| Publication status | Published - 2002 |
| Peer-reviewed | Yes |
Conference
| Title | Fifth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing. ISIRC 2002 |
|---|---|
| Abbreviated title | SIRC 2002 |
| Conference number | |
| Duration | 29 April 2002 |
| Degree of recognition | International event |
| Location | |
| City | Washington |
| Country | United States of America |
Keywords
Research priority areas of TU Dresden
DFG Classification of Subject Areas according to Review Boards
Keywords
- Approximate time, real-time, virtual time, leader election, real-time consistency, adaptation, Clocks, Object oriented modeling, Real time system, Computational modeling, Protocols, Distributed computing, Discrete event simulation, Nominations and elections, Computer science, Processor scheduling, virutal time, rescheduling, local computations, time-lotted leader election protocol