Safety Critical Multiprocessor Real-Time Scheduling with Exact Preemption Cost - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Safety Critical Multiprocessor Real-Time Scheduling with Exact Preemption Cost

(1) , (1)
1

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.
Fichier principal
Vignette du fichier
icons2013.pdf (300.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00786225 , version 1 (08-02-2013)

Identifiers

  • HAL Id : hal-00786225 , version 1

Cite

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⟩
172 View
130 Download

Share

Gmail Facebook Twitter LinkedIn More