Name
Abstract | ||
|---|---|---|
Abstract: The key to the next generation real-time systems is flexible scheduling mechanisms that guarantee hard deadlines and use available spare resources to maximise total system utility. This is a multicriteria scheduling problem. It is argued that common approaches like eager slack usage and mandatory first schemes are not only not optimal but not adequate for a wide class of process models. It is also shown that a late acceptance test model is preferable to an early acceptance test model due to the uncertainty of future behaviour of the system. The discussion is complemented with simulation results. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/EMRTS.2001.933990 | ECRTS |
Keywords | Field | DocType |
process model,available spare resource,multicriteria scheduling problem,eager slack usage,flexible scheduling mechanism,early acceptance test model,total system utility,flexible scheduling,common approach,real-time system,late acceptance test model,computational modeling,dynamic scheduling,resource management,uncertainty,real time systems,system testing,computer science,scheduling problem | Lottery scheduling,Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Real-time computing,Two-level scheduling,Least slack time scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Distributed computing | Conference |
ISSN | ISBN | Citations |
1068-3070 | 0-7695-1221-6 | 2 |
PageRank | References | Authors |
0.38 | 19 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guillem Bernat | 1 | 1669 | 75.20 |
| Alan Burns | 2 | 739 | 59.60 |