Skip to Main content Skip to Navigation
Reports

Co-scheduling Amdahl applications on 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? In this paper, we provide answers to (i) and (ii) for Amdahl 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 Amdahl applications. Extensive simulations demonstrate the usefulness of co-scheduling when our efficient cache partitioning strategies are deployed.
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/hal-01461157
Contributor : Equipe Roma <>
Submitted on : Tuesday, February 7, 2017 - 9:19:55 PM
Last modification on : Wednesday, February 26, 2020 - 11:14:13 AM
Long-term archiving on: : Monday, May 8, 2017 - 3:31:29 PM

File

RR-9021.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01461157, version 1

Collections

Citation

Guillaume Aupy, Anne Benoit, Sicheng Dai, Loïc Pottier, Padma Raghavan, et al.. Co-scheduling Amdahl applications on cache-partitioned systems. [Research Report] RR-9021, Inria. 2017, pp.33. ⟨hal-01461157⟩

Share

Metrics

Record views

673

Files downloads

373