Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms

Abstract : This paper gives and proves correct a simulation interval for any schedule generated by a deterministic and memoryless scheduler (i.e., one where the scheduling decision is the same and unique for any two identical system states) for identical multiprocessor platforms. We first consider independent periodic tasks, then generalize the simulation interval to tasks sharing critical resources, and subject to precedence constraints or self-suspension. The simulation interval is based only on the periods, release times and deadlines, and is independent from any other parameters. It is proved large enough to cover any feasible schedule produced by any deterministic and memoryless scheduler on multiprocessor platforms, including non conservative schedulers. To the best of our knowledge, this simulation interval covers the largest class of task systems and scheduling algorithms on identical multiprocessor platforms ever studied. This simulation interval is used to derive a simulation algorithm using a linear space complexity. Finally, a generic exact schedulability test based on simulation is presented. This test can be applied only when sustainability is consistent with online variability of the tasks’ parameters.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-01419704
Contributor : Liliana Cucu-Grosjean <>
Submitted on : Monday, December 19, 2016 - 6:15:56 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM

Links full text

Identifiers

Citation

Goossens Joël, Emmanuel Grolleau, Liliana Cucu-Grosjean. Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms. Real-Time Systems, Springer Verlag, 2016, 52 (6), pp.808-832. ⟨10.1007/s11241-016-9256-1⟩. ⟨hal-01419704⟩

Share

Metrics

Record views

434