Integrating job parallelism in real-time scheduling theory - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information Processing Letters Year : 2008

Integrating job parallelism in real-time scheduling theory

Sébastien Collette
  • Function : Author
  • PersonId : 844795
Joël Goossens
  • Function : Author
  • PersonId : 830909


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.
Fichier principal
Vignette du fichier
0805.3237v1.pdf (219.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00192215 , version 1 (27-10-2008)



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



Gmail Facebook Twitter LinkedIn More