Global EDF-based scheduling of multiple independent synchronous dataflow graphs

被引：2

作者：

Singh, Abhishek ^{[1
]}

Baruah, Sanjoy ^{[2
]}

机构：

[1] Univ North Carolina Chapel Hill, Chapel Hill, NC 27599 USA

[2] Washington Univ, St Louis, MO 63130 USA

来源：

2017 IEEE REAL-TIME SYSTEMS SYMPOSIUM (RTSS) | 2017年

关键词：

SDF Graphs; constrained-deadline recurrent tasks; global multiprocessor scheduling; speedup-optimal scheduling; pseudo-polynomial time schedulability analysis;

D O I：

10.1109/RTSS.2017.00036

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The global scheduling of systems that can be modeled as collections of multiple independent recurrent real-time tasks, each represented as a synchronous dataflow graph (SDFG), upon an identical multiprocessor platform is considered. An EDFbased scheduling algorithm is proved optimal under the speedup factor metric, and a speedup-optimal sufficient schedulability test is derived.

引用

页码：307 / 318

页数：12