Online and offline scheduling with cache-related preemption delays
Guillaume Phavorin
(1, 2)
,
Pascal Richard
(1, 2)
,
Joël Goossens
(3)
,
Claire Maiza
(4)
,
Laurent George
(5)
,
Thomas Chapeaux
(3)
Pascal Richard
- Fonction : Auteur
- PersonId : 855233
- ORCID : 0000-0003-0061-1971
- IdRef : 07333930X
Laurent George
- Fonction : Auteur
- PersonId : 18827
- IdHAL : laurent-george
- IdRef : 061281190
Résumé
In this paper, we consider the problem of scheduling hard real-time tasks subjected to preemption delays on a uniprocessor system. While most of the existing work focus on either reducing these additional delays or improving the system predictability by bounding them, we focus in this work on the problem of taking scheduling decisions while considering preemption delays. We first study the behavior of existing online scheduling policies such as rm and edf when accounting for preemption delays. Then we prove that there exists no optimal online algorithm for the problem of scheduling sporadic tasks with preemption delays. Eventually, we propose an optimal offline solution to the problem of scheduling tasks subjected to preemption delays using mathematical programming.
Domaines
Systèmes embarquésFormat du dépôt | Notice |
---|---|
Type de dépôt | Article dans une revue |
Titre |
en
Online and offline scheduling with cache-related preemption delays
|
Résumé |
en
In this paper, we consider the problem of scheduling hard real-time tasks subjected to preemption delays on a uniprocessor system. While most of the existing work focus on either reducing these additional delays or improving the system predictability by bounding them, we focus in this work on the problem of taking scheduling decisions while considering preemption delays. We first study the behavior of existing online scheduling policies such as rm and edf when accounting for preemption delays. Then we prove that there exists no optimal online algorithm for the problem of scheduling sporadic tasks with preemption delays. Eventually, we propose an optimal offline solution to the problem of scheduling tasks subjected to preemption delays using mathematical programming.
|
Auteur(s) |
Guillaume Phavorin
1, 2
, Pascal Richard
1, 2
, Joël Goossens
3
, Claire Maiza
4
, Laurent George
5
, Thomas Chapeaux
3
1
LIAS [Poitiers] -
Laboratoire d'informatique et d'automatique pour les systèmes [EA 6315]
( 217518 )
- LISI-ENSMA Téléport 2 – 1 avenue Clément Ader – BP 40109 – 86961 Futuroscope Chasseneuil cedex – france
- France
2
SETR -
Systèmes Embarqués Temps Réel
( 1175374 )
- Laboratoire LIAS - ENSIP Bâtiment B25 - 2 rue Pierre Brousse TSA 41105 86073 Poitiers Cedex 9 France Laboratoire LIAS - ISAE-ENSMA Téléport 2 - 1 avenue Clément Ader BP 40109 86961 Chasseneuil France
- France
3
ULB -
Département d'Informatique [Bruxelles]
( 5591 )
- Campus de la Plaine ULB CP212, boulevard du Triomphe, 1050 Bruxelles
- Belgique
4
VERIMAG - IMAG -
VERIMAG
( 1041816 )
- Verimag
Bâtiment IMAG
Université Grenoble Alpes
700, avenue centrale
38401 Saint Martin d’Hères
- France
5
LIGM -
Laboratoire d'Informatique Gaspard-Monge
( 3210 )
- Université de Paris-Est Marne-la-Vallée, Cité Descartes, Bâtiment Copernic, 5 bd Descartes, 77454 Marne-la-Vallée Cedex 2
- France
|
Nom de la revue |
|
Langue du document |
Anglais
|
Vulgarisation |
Non
|
Comité de lecture |
Oui
|
Audience |
Internationale
|
Date de publication |
2017
|
Page/Identifiant |
1-38
|
Domaine(s) |
|
Mots-clés |
en
Offline scheduling, Online scheduling, rm, edf, Preemption delays, CRPD, Sustainability, Mathematical programming
|
DOI | 10.1007/s11241-017-9275-6 |
Loading...