Schedulability Analysis for Directed Acyclic Graphs on Multiprocessor Systems at a Subtask Level

Abstract : This paper addresses the problem of scheduling parallel real- time tasks of Directed Acyclic Graph (DAG) model on multiprocessor systems. We propose a new scheduling method based on a subtask-level, which means that the schedulability decisions are taken based on the local temporal parameters of subtasks. This method requires modifying the subtasks to add more parameters which are necessary for the analysis, such as local offsets, deadlines and release jitters. Then we provide interference and workload analyses of DAG tasks, and we provide a schedulability test for any work conserving scheduling algorithm.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-01021856
Contributor : Manar Qamhieh <>
Submitted on : Wednesday, July 9, 2014 - 5:19:58 PM
Last modification on : Wednesday, July 4, 2018 - 4:38:03 PM
Long-term archiving on : Thursday, October 9, 2014 - 12:47:45 PM

File

Qamhieh_ADA_Europe14.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01021856, version 1

Citation

Manar Qamhieh, Serge Midonnet. Schedulability Analysis for Directed Acyclic Graphs on Multiprocessor Systems at a Subtask Level. 19th International Conference on Reliable Software Technologies ADA-Europe, ADA-Europe, Jun 2014, Paris, France. pp.N/A. ⟨hal-01021856⟩

Share

Metrics

Record views

398

Files downloads

371