Given such a model, schedulability analysis techniques can be used to analyze an application [17]. Alternately, one can schedule a hard real-time system prerun-time, such that all timing constraints are satisfied and consistency of all resources, including processors, communication media, and device
✦ LIBER ✦
Stabilizing Pre-Run-Time Schedules With the Help of Grace Time
✍ Scribed by Antonio Pessoa Magalhães; João Gabriel Silva
- Book ID
- 110258426
- Publisher
- Springer US
- Year
- 1999
- Tongue
- English
- Weight
- 188 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0922-6443
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Incorporating Temporal Considerations du
✍
Jack P.C. Verhoosel; Lonnie R. Welch; Dieter K. Hammer; Erik J. Luit
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 517 KB
Investigations of timing during the sche
✍
Terry W. Belke; Melissa M. Christie-Fougere
📂
Article
📅
2006
🏛
Elsevier Science
🌐
French
⚖ 251 KB
Stability of flow-level scheduling with
✍
Kim, Jeongsim; Kim, Bara; Kim, Jerim; Bae, Yun Han
📂
Article
📅
2013
🏛
Elsevier Science
🌐
English
⚖ 729 KB
A hybrid design-time/run-time scheduling
✍
Javier Resano; Diederik Verkest; Daniel Mozos; Serge Vernalde; Francky Catthoor
📂
Article
📅
2004
🏛
Elsevier Science
🌐
English
⚖ 521 KB
The complexity of mean flow time schedul
✍
Philippe Baptiste; Peter Brucker; Marek Chrobak; Christoph Dürr; Svetlana A. Kra
📂
Article
📅
2007
🏛
Springer US
🌐
English
⚖ 396 KB
The complexity of scheduling starting ti
✍
T.C.E. Cheng; Q. Ding
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 484 KB
We consider a family of problems of scheduling a set of starting time dependent tasks with release times and linearly increasing/decreasing processing rates on a single machine to minimize the makespan. We first present an equivalence relationship between several pairs of problems. Based on this rel