Mixed Critical Earliest Deadline First - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Mixed Critical Earliest Deadline First

Dario Socci
  • Fonction : Auteur
Peter Poplavko
  • Fonction : Auteur
Saddek Bensalem
Marius Bozga

Résumé

Using the advances of the modern microelectronics technology, the safety-critical systems, such as avionics, can reduce their costs by integrating multiple tasks on one device. This makes such systems essentially mixed-critical, as this brings together different tasks whose safety assurance requirements may differ significantly. In the context of mixed-critical scheduling theory, we studied the dual criticality problem of scheduling a finite set of hard real-time jobs. In this work we propose an algorithm which is proved to dominate OCBP, a state-of-the art algorithm for this problem that is optimal over fixed job priority algorithms. We show through empirical studies that our algorithm can reduce the set of non-schedulable instances by a factor of two or, under certain assumptions, by a factor of four, when compared to OCBP.
Fichier principal
Vignette du fichier
ecrts.pdf (235.97 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00867470 , version 1 (30-09-2013)

Identifiants

Citer

Dario Socci, Peter Poplavko, Saddek Bensalem, Marius Bozga. Mixed Critical Earliest Deadline First. 25th Euromicro Conference on Real-Time Systems, ECRTS 2013, Paris, France, July 9-12, 2013, Jul 2013, Paris, France. pp.93-102, ⟨10.1109/ECRTS.2013.20⟩. ⟨hal-00867470⟩
205 Consultations
334 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More