Bandwidth Bandit: Quantitative Characterization of Memory Contention
2013 (English)In: Proc. 11th International Symposium on Code Generation and Optimization: CGO 2013, IEEE Computer Society, 2013, 99-108 p.Conference paper (Refereed)
On multicore processors, co-executing applications compete for shared resources, such as cache capacity and memory bandwidth. This leads to suboptimal resource allocation and can cause substantial performance loss, which makes it important to effectively manage these shared resources. This, however, requires insights into how the applications are impacted by such resource sharing. While there are several methods to analyze the performance impact of cache contention, less attention has been paid to general, quantitative methods for analyzing the impact of contention for memory bandwidth. To this end we introduce the Bandwidth Bandit, a general, quantitative, profiling method for analyzing the performance impact of contention for memory bandwidth on multicore machines. The profiling data captured by the Bandwidth Bandit is presented in a bandwidth graph. This graph accurately captures the measured application's performance as a function of its available memory bandwidth, and enables us to determine how much the application suffers when its available bandwidth is reduced. To demonstrate the value of this data, we present a case study in which we use the bandwidth graph to analyze the performance impact of memory contention when co-running multiple instances of single threaded application.
Place, publisher, year, edition, pages
IEEE Computer Society, 2013. 99-108 p.
bandwidth, memory, caches
Research subject Computer Science
IdentifiersURN: urn:nbn:se:uu:diva-194101DOI: 10.1109/CGO.2013.6494987ISI: 000318700200010ISBN: 978-1-4673-5524-7OAI: oai:DiVA.org:uu-194101DiVA: diva2:616760
CGO 2013, 23-27 February, Shenzhen, China
FunderSwedish Research Council