A Fast Heuristic for Scheduling Parallel Software with Respect to Energy and Timing Constraints

Sackmann, Margarete; Ebraert, Peter; Janssens, Dirk

doi:10.1109/ipdps.2011.284

Cited by 3 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Jia Xu in [6] proposed an algorithm that can statically schedule tasks with release times, deadlines, precedence and exclusion relations, but he did not take into consideration the periodic tasks, which is one of our main objectives. A fast heuristic for parallel software with respect to energy as well as time constraints was presented in [8], in which the constraint specifies how much time can pass between the moment when all data necessary for the execution of the node is available and the moment when the execution of the node finishes. This is also different from our problem.…”

Section: Introductionmentioning

confidence: 99%

Scheduling of Periodic Tasks with Data Dependency on Multiprocessors

Wang

2013

AMR

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%

Scheduling of Periodic Tasks with Data Dependency on Multiprocessors

Wang

2013

AMR

View full text Add to dashboard Cite

show abstract

Energy-efficient mapping of real-time applications on heterogeneous MPSoCs using task replication

Spasic

Liu

Stefanov

2016

Proceedings of the Eleventh IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis

View full text Add to dashboard Cite

Scheduling of Periodic Tasks with Data Dependency on Multiprocessors

Wang

2012

Proceedings of the 2012 2nd International Conference on Computer and Information Applications (ICCIA 2012)

View full text Add to dashboard Cite

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 implicitdeadline or constrained-deadline can be scheduled on multiprocessor platform effectively.

show abstract

A Fast Heuristic for Scheduling Parallel Software with Respect to Energy and Timing Constraints

Cited by 3 publications

References 18 publications

Scheduling of Periodic Tasks with Data Dependency on Multiprocessors

Scheduling of Periodic Tasks with Data Dependency on Multiprocessors

Energy-efficient mapping of real-time applications on heterogeneous MPSoCs using task replication

Scheduling of Periodic Tasks with Data Dependency on Multiprocessors

Contact Info

Product

Resources

About