Scheduling of Periodic Tasks with Data Dependency on Multiprocessors
This article studies the scheduling problem of a set of tasks with time or data constraints on a number of identical processors with full connections.We present an algorithm,in which a set of static schedule lists can be obtained,each for a processor,such that each task starts executing after its release time and completes its computation before its deadline,and all the precedence relations between tasks resulting from data dependence are satisfied.The data dependence relations between tasks are represented by Synchronous Dataflow Graphs (SDF) as they can indicate tasks concurrency and enable effective scheduling on multiprocessor platforms.The SDF,however,does not support the time constraints of tasks directly,thus an adaption is applied to conform to the time limits.With this adaption,the periodic tasks of implicit-deadline or constrained-deadline can be scheduled on multiprocessor platform effectively.
multiprocessor scheduling real-time SDF data-dependency
Jinlin Wang
Laboratory of Embedded Systems School of Computer Science and Engineering, Beihang University100191, Beijing, China
国际会议
太原
英文
699-702
2012-12-08（万方平台首次上网日期，不代表论文的发表时间）