A Parallelizing Algorithm for Real-Time Tasks of Directed Acyclic Graphs Model

Manar Qamhieh 1, * Serge Midonnet 1 Laurent George 2
* Corresponding author
2 AOSTE - Models and methods of analysis and optimization for systems with real-time and embedding constraints
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Paris-Rocquencourt, Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [3 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00695818
Contributor : Manar Qamhieh <>
Submitted on : Thursday, May 10, 2012 - 11:12:28 AM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Long-term archiving on : Thursday, December 15, 2016 - 5:27:54 AM

File

RTAS2012WiP_Final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00695818, version 1

Citation

Manar Qamhieh, Serge Midonnet, Laurent George. A Parallelizing Algorithm for Real-Time Tasks of Directed Acyclic Graphs Model. RTAS'12 : The 18th IEEE Real-Time and Embedded Technology and Applications Symposium. Work-In-Progress Session, Apr 2012, Beijing, China. pp.45-48. ⟨hal-00695818⟩

Share

Metrics

Record views

757

Files downloads

654