Algorithm and complexity for the global scheduling of sporadic tasks on multiprocessors with work-limited parallelism - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Algorithm and complexity for the global scheduling of sporadic tasks on multiprocessors with work-limited parallelism

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

Abstract

We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on identical multiprocessor platforms. We provide a task model which integrates work-limited job parallelism. For work-limited parallelism, we prove that the time-complexity of deciding if a task set is feasible is linear relatively to the number of (sporadic) tasks for a fixed number of processors. Based on this proof, we propose an optimal scheduling algorithm. Moreover, we provide an \emph{exact} feasibility utilization bound.
No file

Dates and versions

inria-00192213 , version 1 (27-11-2007)

Identifiers

  • HAL Id : inria-00192213 , version 1

Cite

Sébastien Collette, Liliana Cucu, Joël Goossens. Algorithm and complexity for the global scheduling of sporadic tasks on multiprocessors with work-limited parallelism. 15th International Conference on Real-Time and Network systems - RTNS'07, Mar 2007, Nancy, France. pp.123-128. ⟨inria-00192213⟩
63 View
0 Download

Share

Gmail Facebook X LinkedIn More