Dynamic Scheduling Algorithm for Parallel Real-time Graph Tasks

Manar Qamhieh 1 Serge Midonnet 1 Laurent George 2
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 propose a dynamic global scheduling algorithm for a previously-presented specific model of real-time tasks called "Parallel Graphs" [1], based on the Least Laxity First priority assignment policy "LLF", we apply LLF policy on each subtask in the graphs individ- ually, taking in consideration their precedence constraints. This model of tasks is a combination of graphs and par- allelism, in which each subtask in the graph can execute sequentially or parallel according to its number of processors defined by the model. So we study parallelism possibilities in order to find the best structure of the tasks according to the practical specifications of the system.
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00773586
Contributor : Manar Qamhieh <>
Submitted on : Monday, January 14, 2013 - 1:00:28 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Long-term archiving on : Saturday, April 1, 2017 - 4:29:48 AM

File

ecrtsWiP2012_FV.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00773586, version 1

Citation

Manar Qamhieh, Serge Midonnet, Laurent George. Dynamic Scheduling Algorithm for Parallel Real-time Graph Tasks. ACM SIGBED Review, Association for Computing Machinery (ACM), 2012, 9 (Special Issue on the Work-in-Progress session of the 24th Euromicro Conference on Real-Time Systems), pp.12-16. ⟨hal-00773586⟩

Share

Metrics

Record views

874

Files downloads

680