Skip to Main content Skip to Navigation
Conference papers

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 metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-01654660
Contributor : Guillaume Pallez (aupy) <>
Submitted on : Monday, December 4, 2017 - 11:34:55 AM
Last modification on : Monday, April 27, 2020 - 10:10:04 PM

File

apdcm.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Guillaume Aupy, Anne Benoit, Loïc Pottier, Padma Raghavan, Yves Robert, et al.. Co-scheduling algorithms for cache-partitioned systems. APDCM 2017 - 19th Workshop on Advances in Parallel and Distributed Computational Models, May 2017, Orlando (FL), United States. pp.1-10, ⟨10.1109/IPDPSW.2017.60⟩. ⟨hal-01654660⟩

Share

Metrics

Record views

1039

Files downloads

252