Safety Critical Multiprocessor Real-Time Scheduling with Exact Preemption Cost

Falou Ndoye 1 Yves Sorel 1
1 AOSTE - Models and methods of analysis and optimization for systems with real-time and embedding constraints
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Paris-Rocquencourt, COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : In this paper, we address for safety critical ap- plications the problem of multiprocessor real-time scheduling while taking into account the exact preemption cost. In the framework of multiprocessor real-time partitioned scheduling, we propose a greedy heuristic which balances the load of the tasks on all the processors and minimizes the response time of the applications. That heuristic uses a schedulability condition which is based on the ⊕ operation. That operation performs a schedulability analysis while taking into account the exact preemption cost. A performance analysis is achieved which compares the proposed heuristic to the branch and bound exact algorithm and to the worst-fit and best-fit heuristics.
Type de document :
Communication dans un congrès
ICONS 2013 - Eighth International Conference on Systems, Jan 2013, Seville, Spain. IARIA, pp.127-136, 2013
Liste complète des métadonnées

https://hal.inria.fr/hal-00786225
Contributeur : Falou Ndoye <>
Soumis le : vendredi 8 février 2013 - 10:32:36
Dernière modification le : lundi 5 octobre 2015 - 16:57:20
Document(s) archivé(s) le : jeudi 9 mai 2013 - 03:54:27

Fichier

icons2013.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00786225, version 1

Collections

Citation

Falou Ndoye, Yves Sorel. Safety Critical Multiprocessor Real-Time Scheduling with Exact Preemption Cost. ICONS 2013 - Eighth International Conference on Systems, Jan 2013, Seville, Spain. IARIA, pp.127-136, 2013. <hal-00786225>

Partager

Métriques

Consultations de
la notice

235

Téléchargements du document

136