Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/REAL.2004.48 | RTSS |
Keywords | Field | DocType |
execution history,gain time,cost effective real-time system,considerable spare cpu capacity,exploit gain time,worst-case execution time,proposed scheme,spare capacity,dynamic application requirement,real-time task,rewriting history,retrospectively reassigning execution time,cost effectiveness,worst case execution time,computational modeling,application software,real time,real time systems,quality of service,computer science,history,upper bound | Spare part,Capacity sharing,Upper and lower bounds,Computer science,Server,Quality of service,Real-time computing,Exploit,Rewriting,Application software,Distributed computing | Conference |
ISSN | ISBN | Citations |
1052-8725 | 0-7695-2247-5 | 13 |
PageRank | References | Authors |
0.88 | 18 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. Bernat | 1 | 52 | 3.66 |
| I. Broster | 2 | 155 | 10.40 |
| A Burns | 3 | 5034 | 375.85 |