Skip to Main content Skip to Navigation

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.
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Tuesday, November 8, 2016 - 2:33:40 PM
Last modification on : Friday, September 30, 2022 - 4:12:14 AM
Long-term archiving on: : Wednesday, March 15, 2017 - 12:02:36 AM


Files produced by the author(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⟩



Record views


Files downloads