PDPA: Period Driven Task and Cache Partitioning Algorithm for Mumti-core Systems

Abstract : Multi-core architectures are well suited to ful ll the increasing performance requirements of embedded real-time systems. However, such systems also require the capacity to estimate the timing behavior of their critical components. Interference between tasks, as they occur on standard multicore micro-architectures due to cache sharing are still di - cult to predict accurately. An alternative is to remove these indirect interferences between tasks through partitioning of the shared cache and through the use of partitioned task scheduling. In this paper, we present a new algorithm for joint task and cache partitioning in multi-core systems scheduled using non-preemptive EDF. The main novelty of the algorithm is to take into account the tasks' period repartition in the task partitioning problem, which is critical in a non-preemptive context. Other task properties such as task cache requirements are also considered to optimize cache partitioning. Experiments show that our algorithm outperforms the stateof- the-art algorithm for tasks and cache partitioning, named IA3 [18], in terms of schedulability, specially when tasks have varied periods.
Type de document :
Communication dans un congrès
20th International Conference on Real-Time and Network Systems (RTNS 2012), Nov 2012, Pont à Mousson, France. 2012
Liste complète des métadonnées

https://hal.inria.fr/hal-00737591
Contributeur : Isabelle Puaut <>
Soumis le : mardi 2 octobre 2012 - 11:54:43
Dernière modification le : mercredi 16 mai 2018 - 11:23:28

Identifiants

  • HAL Id : hal-00737591, version 1

Citation

Brice Berna, Isabelle Puaut. PDPA: Period Driven Task and Cache Partitioning Algorithm for Mumti-core Systems. 20th International Conference on Real-Time and Network Systems (RTNS 2012), Nov 2012, Pont à Mousson, France. 2012. 〈hal-00737591〉

Partager

Métriques

Consultations de la notice

419