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

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal-cea.archives-ouvertes.fr/cea-00919483
Contributor : Mathieu Jan <>
Submitted on : Monday, December 16, 2013 - 6:27:44 PM
Last modification on : Thursday, February 7, 2019 - 2:20:45 PM
Long-term archiving on: Saturday, April 8, 2017 - 7:17:15 AM

Files

Workinprogress-RTSS.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : cea-00919483, version 1
  • ARXIV : 1312.4509

Collections

CEA | DRT | LIST

Citation

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⟩

Share

Metrics

Record views

193

Files downloads

168