Creating New Real-Time Scheduling Policies: Why and How? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Creating New Real-Time Scheduling Policies: Why and How?

Nicolas Navet
  • Function : Author
  • PersonId : 830599
Mathieu Grenier
  • Function : Author
  • PersonId : 830598

Abstract

In real-time systems, schedulability is mandatory but other application-dependent performance criteria, such as average response time jitters, are most generally of interest. This is typically the case for computer-controlled systems that are known to be very sensitive to various delays induced by resource sharing; the delays reduce the performances of the system or even may jeopardize the stability of the system. We first define the properties that a "good" real-time scheduling algorithm must possess. Then, we exhibit a class of easily-implementable policies that should be well suited to various applicative contexts because these policies provide good trade-off between feasibility and the satisfaction of the application-dependent criteria. We propose a schedulability analysis generic for all policies within this class and simulation models for evaluating other performance criteria.
No file

Dates and versions

inria-00000610 , version 1 (28-08-2007)

Identifiers

  • HAL Id : inria-00000610 , version 1

Cite

Nicolas Navet, Mathieu Grenier. Creating New Real-Time Scheduling Policies: Why and How?. 2nd Taiwanese-French Conference in Information Technologies - TFIT 2005, Mar 2005, Tainan, Taiwan. ⟨inria-00000610⟩
45 View
0 Download

Share

Gmail Facebook X LinkedIn More