Optimal symbiosis and fair scheduling in shared cache
Document Type
Article
Publication Date
9-20-2016
Department
Department of Computer Science; Center for Scalable Architectures and Systems
Abstract
On multi-core processors, applications are run sharing the cache. This paper presents optimization theory to co-locate applications to minimize cache interference and maximize performance. The theory precisely specifies MRC-based composition, optimization, and correctness conditions. The paper also presents a new technique called footprint symbiosis to obtain the best shared cache performance underfair CPU allocation as well as a new sampling technique which reduces the cost of locality analysis. When sampling and optimization are combined, the paper shows that it takes less than 0.1 second analysis per program to obtain a co-run that is within 1.5 percent of the best possible performance. In an exhaustive evaluation with 12,870 tests, the best prior work improves co-run performance by 56 percent on average. The new optimization improves it by another 29 percent. Without single co-run test, footprint symbiosis is able to choose co-run choices that are just 8 percent slower than the best co-run solutions found with exhaustive testing.
Publication Title
IEEE Transactions on Parallel and Distributed Systems
Recommended Citation
Hu, X.,
Wang, X.,
Li, Y.,
Luo, Y.,
Ding, C.,
&
Wang, Z.
(2016).
Optimal symbiosis and fair scheduling in shared cache.
IEEE Transactions on Parallel and Distributed Systems,
28(4), 1134-1148.
http://doi.org/10.1109/TPDS.2016.2611572
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/1136