 |
HAL UPEC - UPEM Portal |  |
 |
Journal articles
Dynamic Scheduling Algorithm for Parallel Real-time Graph Tasks
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.
Cited literature [4 references]
https://hal-upec-upem.archives-ouvertes.fr/hal-00773586
Contributor : Manar Qamhieh Connect in order to contact the contributor
Submitted on : Monday, January 14, 2013 - 1:00:28 PM
Last modification on : Tuesday, October 19, 2021 - 11:26:19 AM
Long-term archiving on: : Saturday, April 1, 2017 - 4:29:48 AM
Contributor : Manar Qamhieh Connect in order to contact the contributor
Submitted on : Monday, January 14, 2013 - 1:00:28 PM
Last modification on : Tuesday, October 19, 2021 - 11:26:19 AM
Long-term archiving on: : Saturday, April 1, 2017 - 4:29:48 AM
File
ecrtsWiP2012_FV.pdf
Files produced by the author(s)