Contenders: predicting cache contention of co-scheduled applications
To increase the resource utilisation rate in modern data centres, multiple applications are co-scheduled on one server, which can lead to severe performance degradation due to the contention for shared resources. This makes it desirable to accurately predict the performance impact before making a scheduling decision. This work considers contention in the last-level cache (LLC), a scarce resource that must be shared by co-scheduled applications. We propose CONTENDERS, a novel approach to predict the increase in cache misses and running time that applications would experience if they were co-scheduled. It generates a frequency-layered profile for each application by running it with a new set of micro-benchmarks. Based on the profiles, it estimates how much of the contested cache each application would occupy and derives its cache misses and running time from it. Our approach is evaluated on selected and random sets of applications. It is compared with two state-of-the-art prediction tools, and the results demonstrate that CONTENDERS has a much higher prediction accuracy than these tools.
History
School
- Science
Department
- Computer Science
Published in
2025 IEEE 25th International Symposium on Cluster, Cloud and Internet Computing (CCGrid)Source
IEEE International Symposium on Cluster, Cloud, and Internet ComputingPublisher
IEEEVersion
- AM (Accepted Manuscript)
Rights holder
© IEEEPublisher statement
This accepted manuscript can be made available under the Creative Commons Attribution licence (CC BY) under the IEEE JISC UK green open access agreement.Acceptance date
2025-02-18Copyright date
2025eISSN
2993-2114Publisher version
Language
- en