Maximizing Parallelism without Exploding Deadlines in a Mixed Criticality Embedded System

Abstract : Complex embedded systems today commonly involve a mix of real-time and best-effort applications. The recent emergence of small low-cost commodity UMA multicore processors raises the possibility of running both kinds of applications on a single machine, with virtualization ensuring that the best-effort applications cannot steal CPU cycles from the real-time applications. Nevertheless, memory contention can introduce other sources of delay, that can lead to missed deadlines. In this research report, we present a combined offline/online memory bandwidth monitoring approach. Our approach estimates and limits the impact of the memory contention incurred by the best-effort applications on the execution time of the real-time application. We show that our approach is compatible with the hardware counters provided by current small commodity multicore processors. Using our approach, the system designer can limit the overhead on the real-time application to under 5% of its expected execution time, while still enabling progress of the best-effort applications.
Type de document :
[Research Report] RR-8838, Inria. 2016
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger
Contributeur : Gilles Muller <>
Soumis le : jeudi 4 février 2016 - 21:08:52
Dernière modification le : jeudi 11 janvier 2018 - 06:28:04
Document(s) archivé(s) le : samedi 12 novembre 2016 - 09:45:47


Fichiers produits par l'(les) auteur(s)


Distributed under a Creative Commons Paternité 4.0 International License


  • HAL Id : hal-01268078, version 1



Antoine Blin, Cédric Courtaud, Julien Sopena, Julia Lawall, Gilles Muller. Maximizing Parallelism without Exploding Deadlines in a Mixed Criticality Embedded System. [Research Report] RR-8838, Inria. 2016. 〈hal-01268078〉



Consultations de la notice


Téléchargements de fichiers