Multicore CPU Reclaiming: Parallel or Sequential?
Document type :
Communication dans un congrès avec actes
DOI :
Title :
Multicore CPU Reclaiming: Parallel or Sequential?
Author(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]
Conference title :
31st ACM Symposium on Applied Computing
City :
Pise
Country :
Italie
Start date of the conference :
2016-04-04
Journal title :
Proceedings of the 31st ACM Symposium on Applied Computing
Publication date :
2016-04-04
English keyword(s) :
Real-Time Scheduling
multiprocessor
Reclaiming unused bandwidth
multiprocessor
Reclaiming unused bandwidth
HAL domain(s) :
Informatique [cs]/Systèmes embarqués
Informatique [cs]/Système d'exploitation [cs.OS]
Informatique [cs]/Système d'exploitation [cs.OS]
English abstract : [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. ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.archives-ouvertes.fr/hal-01286130/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-01286130/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-01286130/document
- Open access
- Access the document
- document
- Open access
- Access the document
- hal.pdf
- Open access
- Access the document