A Risk-Constrained Markov Decision Process Approach to Scheduling Mixed-Criticality Job Sets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

A Risk-Constrained Markov Decision Process Approach to Scheduling Mixed-Criticality Job Sets

Résumé

We consider the problem of scheduling Mixed Criticality (MC) job systems with an arbitrary number of criticality levels on a single processing platform, when job demands are probabilistic and their distributions are known. We develop a probabilistic framework for MC scheduling, where feasibility is defined as the risk of missing deadlines, which we express in terms of (chance) constraints on the probabilities that jobs of every criticality miss their deadlines. Our goal is to identify and compute " efficiently implementable " scheduling policies under which the given probabilistic constraints are satisfied. We model the problem as a Constrained Markov Decision Process (CMDP), and we show that a feasible Markov randomized scheduling policy exists if the given instance is feasible in a probabilistic sense. A feasible policy can be obtained by solving a linear program. To counter the potential state space explosion, we outline an approximation method that might trade feasibility for efficiency, but which performs well in practice.
Fichier principal
Vignette du fichier
paper13.pdf (204.95 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01403223 , version 1 (25-11-2016)

Identifiants

  • HAL Id : hal-01403223 , version 1

Citer

Bader Alahmad, Sathish Gopalakrishnan. A Risk-Constrained Markov Decision Process Approach to Scheduling Mixed-Criticality Job Sets. Workshop on Mixed Criticality Systems (WMC 2016), Nov 2016, Porto, Portugal. ⟨hal-01403223⟩

Collections

WMC2016
125 Consultations
372 Téléchargements

Partager

Gmail Facebook X LinkedIn More