Cache-aware static scheduling for hard real-time multicore systems based on communication affinities - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Cache-aware static scheduling for hard real-time multicore systems based on communication affinities

(1) , (1) ,
1

Abstract

The growing need for continuous processing capabilities has led to the development of multicore systems with a complex cache hierarchy. Such multicore systems are generally designed for improving the performance in average case, while hard real-time systems must consider worst-case scenarios. An open challenge is therefore to efficiently schedule hard real-time tasks on a multicore architecture. In this work, we propose a mathematical formulation for computing a static scheduling that minimize L1 data cache misses between hard real-time tasks on a multicore architecture using communication affinities.
Fichier principal
Vignette du fichier
Workinprogress-RTSS.pdf (168.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

cea-00919483 , version 1 (16-12-2013)

Identifiers

Cite

Lilia Zaourar, Mathieu Jan, Maurice Pitel. Cache-aware static scheduling for hard real-time multicore systems based on communication affinities. 34th IEEE Real-Time Systems Symposium (RTSS'13), WiP session, Dec 2013, Vancouver, Canada. pp.3-4. ⟨cea-00919483⟩

Collections

CEA DRT LIST
150 View
78 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More