Co-scheduling algorithms for cache-partitioned systems

Abstract : Cache-partitioned architectures allow subsections of the shared last-level cache (LLC) to be exclusively reserved for some applications. This technique dramatically limits interactions between applications that are concurrently executing on a multi-core machine. Consider n applications that execute concurrently, with the objective to minimize the makespan, defined as the maximum completion time of the n applications. Key scheduling questions are: (i) which proportion of cache and (ii) how many processors should be given to each application? Here, we assign rational numbers of processors to each application, since they can be shared across applications through multi-threading. In this paper, we provide answers to (i) and (ii) for perfectly parallel applications. Even though the problem is shown to be NP-complete, we give key elements to determine the subset of applications that should share the LLC (while remaining ones only use their smaller private cache). Building upon these results, we design efficient heuristics for general applications. Extensive simulations demonstrate the usefulness of co-scheduling when our efficient cache partitioning strategies are deployed.
Type de document :
[Research Report] RR-8965, INRIA Grenoble - Rhone-Alpes; ENS de Lyon. 2016, pp.28
Liste complète des métadonnées

Littérature citée [28 références]  Voir  Masquer  Télécharger
Contributeur : Equipe Roma <>
Soumis le : mardi 8 novembre 2016 - 14:33:40
Dernière modification le : vendredi 20 avril 2018 - 15:44:27
Document(s) archivé(s) le : mercredi 15 mars 2017 - 00:02:36


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01393989, version 1



Guillaume Aupy, Anne Benoit, Loïc Pottier, Padma Raghavan, Yves Robert, et al.. Co-scheduling algorithms for cache-partitioned systems. [Research Report] RR-8965, INRIA Grenoble - Rhone-Alpes; ENS de Lyon. 2016, pp.28. 〈hal-01393989〉



Consultations de la notice


Téléchargements de fichiers