Title | ||
---|---|---|
A Capacity Augmentation Bound for Real-Time Constrained-Deadline Parallel Tasks Under GEDF. |
Abstract | ||
---|---|---|
Capacity augmentation bound is a widely used quantitative metric in theoretical studies of schedulability analysis for directed acyclic graph (DAG) parallel real-time tasks, which not only quantifies the suboptimality of the scheduling algorithms, but also serves as a simple linear-time schedulability test. Earlier studies on capacity augmentation bounds of the sporadic DAG task model were either ... |
Year | DOI | Venue |
---|---|---|
2018 | 10.1109/TCAD.2018.2857362 | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems |
Keywords | Field | DocType |
Task analysis,Optimal scheduling,Real-time systems,Scheduling,Scheduling algorithms,Measurement | Mathematical optimization,Task analysis,Scheduling (computing),Upper and lower bounds,Computer science,Directed acyclic graph,Real-time computing,Earliest deadline first scheduling | Journal |
Volume | Issue | ISSN |
37 | 11 | 0278-0070 |
Citations | PageRank | References |
2 | 0.36 | 0 |
Authors | ||
7 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jinghao Sun | 1 | 13 | 2.93 |
Nan Guan | 2 | 95 | 21.53 |
Xu Jiang | 3 | 33 | 5.90 |
Shuangshuang Chang | 4 | 6 | 2.10 |
Zhishan Guo | 5 | 329 | 34.04 |
Qingxu Deng | 6 | 361 | 46.24 |
Wang Yi | 7 | 4232 | 332.05 |