Skip to main content
Article thumbnail
Location of Repository

Periodicity of Real-Time Schedules for Dependent Periodic Tasks on Identical Multiprocessor Platforms

By Joël Goossens, Emmanuel Grolleau and Liliana Cucu-Grosjean


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.SCOPUS: ar.jinfo:eu-repo/semantics/publishe

Topics: Informatique générale, Multiprocessor, Real-time scheduling, Simulation intervals
Year: 2016
DOI identifier: 10.1007/s11241-016-9256-1
OAI identifier:
Provided by: DI-fusion
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.