Architecture multi-coeurs et temps d'exécution au pire cas

Benjamin Lesage 1
1 ALF - Amdahl's Law is Forever
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
Abstract : Critical tasks in the context of real-time systems submit to both timing and correctness constraints. Whence, the validation of a real-time system rely on the estimation of its tasks’ Worst case execution times. Resource sharing, as it occurs on multicore architectures, hinders the computation of such estimates. The timing behaviour of a task is impacted by its concurrents, whether because of resource access arbitration or concurrent modifications of a resource state. This study focuses on estimating the contribution of the memory hierarchy to tasks’ worst case execution time. Existing analysis methods, defined for instruction caches, are extended to support private and shared data caches, hence allowing for the analysis of rich memory hierarchies. Cache bypass is then used to reduce the pressure laid by concurrent tasks on shared caches levels. We propose different bypass heuristics, based on the capture of cache blocks’ reuse between memory accesses. Our second proposal is the Preti partitioning scheme which allows for the allocation to tasks of a cache space, free from inter-task conflicts. Preti offers the added benefit of providing for average-case performance to non-critical tasks concurrent to real-time ones on hybrid criticality systems.
Document type :
Complete list of metadatas

Cited literature [104 references]  Display  Hide  Download
Contributor : Abes Star <>
Submitted on : Tuesday, October 8, 2013 - 2:49:27 PM
Last modification on : Thursday, November 15, 2018 - 11:57:43 AM
Long-term archiving on : Thursday, January 9, 2014 - 4:30:58 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00870971, version 1


Benjamin Lesage. Architecture multi-coeurs et temps d'exécution au pire cas. Autre [cs.OH]. Université Rennes 1, 2013. Français. ⟨NNT : 2013REN1S034⟩. ⟨tel-00870971⟩



Record views


Files downloads