Analyse pire cas pour processeur multi-cœurs disposant de caches partagés

Damien Hardy 1
1 ALF - Amdahl's Law is Forever
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
Abstract :       Hard real-time systems are subject to timing constraints and failure to respect them can cause economic, ecological or human disasters. The validation process which guarantees the safety of such software, by ensuring the respect of these constraints in all situations including the worst case, is based on the knowledge of the worst case execution time of each task. However, determining the worst case execution time is a difficult problem for modern architectures because of complex hardware mechanisms that could cause significant execution time variability. This document focuses on the analysis of the worst case timing behavior of cache hierarchies, to determine their contribution to the worst case execution time. Several approaches are proposed to predict and improve the worst case execution time of tasks running on multicore processors with a cache hierarchy in which some cache levels are shared between cores.
Complete list of metadatas

Cited literature [112 references]  Display  Hide  Download
Contributor : Damien Hardy <>
Submitted on : Tuesday, January 18, 2011 - 2:22:46 PM
Last modification on : Friday, November 16, 2018 - 1:40:24 AM
Long-term archiving on : Tuesday, April 19, 2011 - 3:08:11 AM


  • HAL Id : tel-00557058, version 1


Damien Hardy. Analyse pire cas pour processeur multi-cœurs disposant de caches partagés. Réseaux et télécommunications [cs.NI]. Université Rennes 1, 2010. Français. ⟨tel-00557058⟩



Record views


Files downloads