Skip to Main content Skip to Navigation
Conference papers

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, Laboratoire I3S - 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-00786225
Contributor : Falou Ndoye <>
Submitted on : Friday, February 8, 2013 - 10:32:36 AM
Last modification on : Tuesday, May 26, 2020 - 6:50:21 PM
Document(s) archivé(s) le : Thursday, May 9, 2013 - 3:54:27 AM

File

icons2013.pdf
Files produced by the author(s)

Identifiers

  • 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. pp.127-136. ⟨hal-00786225⟩

Share

Metrics

Record views

382

Files downloads

223