HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Integrating job parallelism in real-time scheduling theory

Sébastien Collette 1 Liliana Cucu 2, * Joël Goossens 1
* Corresponding author
2 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. We prove that the time-complexity of the feasibility problem of these systems is linear relatively to the number of (sporadic) tasks for a fixed number of processors. We propose a scheduling algorithm theoretically optimal (i.e., preemptions and migrations neglected). Moreover, we provide an exact feasibility utilization bound. Lastly, we propose a technique to limit the number of migrations and preemptions.
Document type :
Journal articles
Complete list of metadata

Contributor : Liliana Cucu-Grosjean Connect in order to contact the contributor
Submitted on : Monday, October 27, 2008 - 12:10:53 PM
Last modification on : Friday, February 4, 2022 - 3:24:50 AM
Long-term archiving on: : Monday, April 12, 2010 - 5:14:42 AM


Files produced by the author(s)




Sébastien Collette, Liliana Cucu, Joël Goossens. Integrating job parallelism in real-time scheduling theory. Information Processing Letters, Elsevier, 2008, 106 (5), pp.180-187. ⟨10.1016/j.ipl.2007.11.014⟩. ⟨inria-00192215⟩



Record views


Files downloads