Multicore CPU Reclaiming: Parallel or Sequential?
Type de document :
Communication dans un congrès avec actes
DOI :
Titre :
Multicore CPU Reclaiming: Parallel or Sequential?
Auteur(s) :
Abeni, Luca [Auteur]
Università degli Studi di Trento = University of Trento [UNITN]
Lipari, Giuseppe [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Parri, Andrea [Auteur]
Scuola Universitaria Superiore Sant'Anna = Sant'Anna School of Advanced Studies [Pisa] [SSSUP]
Sun, Youcheng [Auteur]
Scuola Universitaria Superiore Sant'Anna = Sant'Anna School of Advanced Studies [Pisa] [SSSUP]
Università degli Studi di Trento = University of Trento [UNITN]
Lipari, Giuseppe [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Parri, Andrea [Auteur]
Scuola Universitaria Superiore Sant'Anna = Sant'Anna School of Advanced Studies [Pisa] [SSSUP]
Sun, Youcheng [Auteur]
Scuola Universitaria Superiore Sant'Anna = Sant'Anna School of Advanced Studies [Pisa] [SSSUP]
Titre de la manifestation scientifique :
31st ACM Symposium on Applied Computing
Ville :
Pise
Pays :
Italie
Date de début de la manifestation scientifique :
2016-04-04
Titre de la revue :
Proceedings of the 31st ACM Symposium on Applied Computing
Date de publication :
2016-04-04
Mot(s)-clé(s) en anglais :
Real-Time Scheduling
multiprocessor
Reclaiming unused bandwidth
multiprocessor
Reclaiming unused bandwidth
Discipline(s) HAL :
Informatique [cs]/Systèmes embarqués
Informatique [cs]/Système d'exploitation [cs.OS]
Informatique [cs]/Système d'exploitation [cs.OS]
Résumé en anglais : [en]
When integrating hard, soft and non-real-time tasks in general purpose operating systems, it is necessary to provide temporal isolation so that the timing properties of one task do not depend on the behaviour of the others. ...
Lire la suite >When integrating hard, soft and non-real-time tasks in general purpose operating systems, it is necessary to provide temporal isolation so that the timing properties of one task do not depend on the behaviour of the others. However, strict budget enforcement can lead to inefficient use of the computational resources in the presence of tasks with variable workload. Many resource reclaiming algorithms have been proposed in the literature for single processor scheduling , but not enough work exists for global scheduling in mul-tiprocessor systems. In this paper we propose two reclaiming algorithms for multiprocessor global scheduling and we prove their correctness. We also present their implementation in the Linux kernel and we compare their performance on synthetic experiments.Lire moins >
Lire la suite >When integrating hard, soft and non-real-time tasks in general purpose operating systems, it is necessary to provide temporal isolation so that the timing properties of one task do not depend on the behaviour of the others. However, strict budget enforcement can lead to inefficient use of the computational resources in the presence of tasks with variable workload. Many resource reclaiming algorithms have been proposed in the literature for single processor scheduling , but not enough work exists for global scheduling in mul-tiprocessor systems. In this paper we propose two reclaiming algorithms for multiprocessor global scheduling and we prove their correctness. We also present their implementation in the Linux kernel and we compare their performance on synthetic experiments.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.archives-ouvertes.fr/hal-01286130/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-01286130/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-01286130/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- hal.pdf
- Accès libre
- Accéder au document