 |
Free and accessible knowledge |
Conference papers
A Parallelizing Algorithm for Real-Time Tasks of Directed Acyclic Graphs Model
Abstract : In this paper, we consider parallel real-time tasks follow- ing a Directed Acyclic Graph (DAG) model. This task model is classical in embedded and industrial system applications. Each real-time task is defined by a set of subtasks under precedence constraints. With each subtask being associated a worst case execution time and a maximal degree of parallelism. We propose a parallelizing algorithm based on the critical path concept, in which we find the best parallelizing structure of the task according to the response time and the required number of processors, considering the worst case execution time of the subtasks.
Cited literature [3 references]
https://hal-upec-upem.archives-ouvertes.fr/hal-00695818
Contributor : Manar Qamhieh Connect in order to contact the contributor
Submitted on : Thursday, May 10, 2012 - 11:12:28 AM
Last modification on : Thursday, January 20, 2022 - 5:29:32 PM
Long-term archiving on: : Thursday, December 15, 2016 - 5:27:54 AM
Contributor : Manar Qamhieh Connect in order to contact the contributor
Submitted on : Thursday, May 10, 2012 - 11:12:28 AM
Last modification on : Thursday, January 20, 2022 - 5:29:32 PM
Long-term archiving on: : Thursday, December 15, 2016 - 5:27:54 AM
File
RTAS2012WiP_Final.pdf
Files produced by the author(s)