Allocation of Real-Time Tasks onto Identical ...
Type de document :
Autre communication scientifique (congrès sans actes - poster - séminaire...): Communication dans un congrès avec actes
DOI :
Titre :
Allocation of Real-Time Tasks onto Identical Core Platforms under Deferred fixed Preemption-Point Model
Auteur(s) :
Senoussaoui, Ikram [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Zahaf, Houssam-Eddine [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Benhaoua, Mohammed Kamel [Auteur]
Université d'Oran 1 Ahmed Ben Bella [Oran]
Lipari, Giuseppe [Auteur]
Olejnik, Richard [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Zahaf, Houssam-Eddine [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Benhaoua, Mohammed Kamel [Auteur]
Université d'Oran 1 Ahmed Ben Bella [Oran]
Lipari, Giuseppe [Auteur]
Olejnik, Richard [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Titre de la manifestation scientifique :
RTNS 2020: 28th International Conference on Real-Time Networks and Systems
Ville :
Paris France
Pays :
France
Date de début de la manifestation scientifique :
2020-06-10
Éditeur :
ACM
Discipline(s) HAL :
Informatique [cs]/Systèmes embarqués
Résumé en anglais : [en]
Deferred-preemption model has been proposed as a compromise between fully preemptive and non-preemptive systems: on one hand they reduce the cache related preemption delays; on the other hand they introduce a small blocking ...
Lire la suite >Deferred-preemption model has been proposed as a compromise between fully preemptive and non-preemptive systems: on one hand they reduce the cache related preemption delays; on the other hand they introduce a small blocking time to higher priority tasks. In this paper, we investigate the problem of allocating a set of real-time tasks with fixed-preemption points onto an identical multi-core platform. We first propose enumerative and branch-and-bound optimal algorithms, along with techniques to reduce their execution time. Further, we propose a set of heuristics to solve the same problem. We demonstrate the performances of the proposed approaches by the means of a large set of synthetic experiments. ACM Reference Format:Lire moins >
Lire la suite >Deferred-preemption model has been proposed as a compromise between fully preemptive and non-preemptive systems: on one hand they reduce the cache related preemption delays; on the other hand they introduce a small blocking time to higher priority tasks. In this paper, we investigate the problem of allocating a set of real-time tasks with fixed-preemption points onto an identical multi-core platform. We first propose enumerative and branch-and-bound optimal algorithms, along with techniques to reduce their execution time. Further, we propose a set of heuristics to solve the same problem. We demonstrate the performances of the proposed approaches by the means of a large set of synthetic experiments. ACM Reference Format:Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.archives-ouvertes.fr/hal-02886816/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-02886816/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-02886816/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- main.pdf
- Accès libre
- Accéder au document
- 3394810.3394821
- Accès libre
- Accéder au document