Scheduling of Periodic Tasks with Data Dependency on Multiprocessors

DOI

10.2991/iccia.2012.168How to use a DOI?

Keywords

multiprocessor, scheduling, real-time, SDF, data-dependency

Abstract

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 dependency are satisfied. The data dependency 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.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jinlin Wang
PY  - 2014/05
DA  - 2014/05
TI  - Scheduling of Periodic Tasks with Data Dependency on Multiprocessors
BT  - Proceedings of the 2012 2nd International Conference on Computer and Information Application (ICCIA 2012)
PB  - Atlantis Press
SP  - 699
EP  - 702
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccia.2012.168
DO  - 10.2991/iccia.2012.168
ID  - Wang2014/05
ER  -