Cache related pre-emption delays in ...
Document type :
Article dans une revue scientifique
Title :
Cache related pre-emption delays in hierarchical scheduling
Author(s) :
Lunniss, Will [Auteur]
Altmeyer, Sebastian [Auteur]
Laboratory of Advanced Software SYstems [Luxembourg] [LASSY]
Lipari, Giuseppe [Auteur correspondant]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Davis, Robert [Auteur]
Altmeyer, Sebastian [Auteur]
Laboratory of Advanced Software SYstems [Luxembourg] [LASSY]
Lipari, Giuseppe [Auteur correspondant]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Davis, Robert [Auteur]
Journal title :
Real-Time Systems
Pages :
201-238
Publisher :
Springer Verlag
Publication date :
2016
ISSN :
0922-6443
English keyword(s) :
Cache related pre-emption delays
Hierarchical scheduling
Fixed priority pre-emptive scheduling
Earliest deadline first pre-emptive scheduling
Response time analysis
Hierarchical scheduling
Fixed priority pre-emptive scheduling
Earliest deadline first pre-emptive scheduling
Response time analysis
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]
Hierarchical scheduling provides a means of composing multiple real-time applications onto a single processor such that the temporal requirements of each application are met. This has become a popular technique in industry ...
Show more >Hierarchical scheduling provides a means of composing multiple real-time applications onto a single processor such that the temporal requirements of each application are met. This has become a popular technique in industry as it allows applications from multiple vendors as well as legacy applications to co-exist in isolation on the same platform. However, performance enhancing features such as caches mean that one application can interfere with another by evicting blocks from cache that were in use by another application, violating the requirement of temporal isolation. In this paper, we present analysis that bounds the additional delay due to blocks being evicted from cache by other applications in a system using hierarchical scheduling when using either a local FP or EDF scheduler.Show less >
Show more >Hierarchical scheduling provides a means of composing multiple real-time applications onto a single processor such that the temporal requirements of each application are met. This has become a popular technique in industry as it allows applications from multiple vendors as well as legacy applications to co-exist in isolation on the same platform. However, performance enhancing features such as caches mean that one application can interfere with another by evicting blocks from cache that were in use by another application, violating the requirement of temporal isolation. In this paper, we present analysis that bounds the additional delay due to blocks being evicted from cache by other applications in a system using hierarchical scheduling when using either a local FP or EDF scheduler.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.archives-ouvertes.fr/hal-01287347/document
- Open access
- Access the document
- http://www-users.cs.york.ac.uk/%7Erobdavis/papers/RTSHierarchicalCRPD.pdf
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-01287347/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-01287347/document
- Open access
- Access the document