Programming execution-time servers in Ada 2005
IRTAW '07 Proceedings of the 13th international workshop on Real-time Ada
A capacity sharing and stealing strategy for open real-time systems
Journal of Systems Architecture: the EUROMICRO Journal
Implementing mixed criticality systems in Ada
Ada-Europe'11 Proceedings of the 16th Ada-Europe international conference on Reliable software technologies
| Hi-index | 0.00 |
With modern processors and more dynamic application requirements it is becoming increasingly difficult to produce tight upper bounds on the worst-case execution time of real-time tasks. As a result, at run-time, considerable spare CPU capacity (termed gain time) becomes available that must be usefully employed if cost effective real-time systems are to be engineered. In this paper we introduce a scheme by which gain time is exploited by retrospectively reassigning execution time from a taskýs own budget to the gain time that later become available. As a result of changing the systemýs execution history, spare capacity is immediately reallocated and hence preserved. The proposed scheme is shown to work with fixed priority dispatching, the use of servers to provide temporal firewalls, and other capacity sharing approaches. Evaluations are provided via simulations.