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.
@article{arxiv.1312.4509,
title = {Cache-aware static scheduling for hard real-time multicore systems based on communication affinities},
author = {Lilia Zaourar and Mathieu Jan and Maurice Pitel},
journal= {arXiv preprint arXiv:1312.4509},
year = {2013}
}