The Non-Optimality of the Monotonic Priority Assignmentsfor Hard Real-Time Offset Free Systems

  • Authors:
  • J. Goossens;R. Devillers

  • Affiliations:
  • Université Libre de Bruxelles, Département d‘Informatique CP 212, Boulevard du Triomphe, 1050 Brussels, Belgium.;Université Libre de Bruxelles, Département d‘Informatique CP 212, Boulevard du Triomphe, 1050 Brussels, Belgium.

  • Venue:
  • Real-Time Systems
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we study the problem of scheduling hardreal-time periodic tasks with static priority pre-emptive algorithms.We consider tasks which are characterized by a period, a harddeadline, a computation time and an offset (the time of the firstrequest), where the offsets may be chosen by the scheduling algorithm,hence the denomination offset free systems. We study the ratemonotonic and the deadline monotonic priority assignments forthis kind of system and we compare the offset free systems andthe asynchronous systems in terms of priority assignment. Hence,we show that the rate and the deadline monotonic priority assignmentsare not optimal for offset free systems.