Dynamic Scheduling Algorithm for Parallel Real-time Graph Tasks - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM SIGBED Review Année : 2012

Dynamic Scheduling Algorithm for Parallel Real-time Graph Tasks

Résumé

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.
Fichier principal
Vignette du fichier
ecrtsWiP2012_FV.pdf (230.08 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00773586 , version 1 (14-01-2013)

Identifiants

  • HAL Id : hal-00773586 , version 1

Citer

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

Partager

Gmail Facebook X LinkedIn More