Priority-based scheduling of mixed-critical jobs - IMAG Accéder directement au contenu
Article Dans Une Revue Real-Time Systems Année : 2019

Priority-based scheduling of mixed-critical jobs

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

Résumé

Modern real-time systems tend to be mixed-critical, in the sense that they integrate on the same computational platform applications at different levels of criticality (e.g., safety critical and mission critical). Scheduling of such systems is a popular topic in literature due to the complexity and importance of the problem. In this paper we propose two algorithms for job scheduling in mixed critical systems: mixed criticality earliest deadline first (MCEDF) and mixed critical priority improvement (MCPI). MCEDF is a single processor algorithm that theoretically dominates state-of-the-art fixed-priority algorithm own criticality based priority (OCBP), while having a better computational complexity. The dominance is achieved by profiting from a common extension of fixed-priority online policy to mixed criticality. MCPI is a multiprocessor algorithm that supports dependency constraints. Experiments show good schedulability results. Also we formally prove that both MCEDF and MCPI are optimal in a particular class of algorithms.
Fichier principal
Vignette du fichier
scheduling.pdf (905.65 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04580646 , version 1 (23-05-2024)

Identifiants

Citer

Dario Socci, Peter Poplavko, Saddek Bensalem, Marius Bozga. Priority-based scheduling of mixed-critical jobs. Real-Time Systems, 2019, 55 (4), pp.709-773. ⟨10.1007/S11241-019-09329-9⟩. ⟨hal-04580646⟩
1 Consultations
2 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More