Skip to Main content Skip to Navigation
Conference papers

Near-Optimal Fixed Priority Preemptive Scheduling of Offset Free Systems

Mathieu Grenier 1 Joël Goossens 2 Nicolas Navet 1
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper, we study the problem of the fixed priority scheduling of hard real-time tasks. We consider independent tasks, which are characterized by a period, a hard deadline, a computation time, and an offset (the time of the first request) where the latter can be chosen by the scheduling algorithm. Considering only the synchronous case is very pessimistic for offset free systems, since the synchronous case is the worst case. An heuristic has been proposed in the past to choose the offsets. In this paper, we propose a new technique, based on the Audsley's priority assignment, to reduce significantly the search space. In addition, we propose new offset assignment heuristics and show the improvement of combining the new technique and the new heuristics.
Document type :
Conference papers
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download
Contributor : Mathieu Grenier <>
Submitted on : Tuesday, July 4, 2006 - 3:19:25 PM
Last modification on : Thursday, June 4, 2020 - 10:40:07 AM
Long-term archiving on: : Monday, April 5, 2010 - 11:46:36 PM


  • HAL Id : inria-00083863, version 1



Mathieu Grenier, Joël Goossens, Nicolas Navet. Near-Optimal Fixed Priority Preemptive Scheduling of Offset Free Systems. 14th International Conference on Real-Time and Networks Systems (RTNS'06), May 2006, Poitiers/France, pp.35--42. ⟨inria-00083863⟩



Record views


Files downloads