A utility based cache optimization mechanism for multi-thread workloads

Yixuan Tang*, Junmin Wu, Guoliang Chen, Xiufeng Sui, Jing Huang

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

1 引用 (Scopus)

摘要

Modern multi-core processors usually employ shared level 2 cache to support fast data access among concurrent threads. However, under the pressure of high resource demand, the commonly used LRU policy may result in interferences among threads and degrades the overall performance. Partitioning the shared cache is a relatively flexible resource allocation method, but most previous partition approaches aimed at multi-programmed workloads and they ignored the difference between shared and private data access patterns of multi-threaded workloads, leading to the utility decrease of the shared data. Most traditional cache partitioning methods aim at single memory access pattern, and neglect the frequency and recency information of cachelines. In this paper, we study the access characteristics of private and shared data in multi-thread workloads, and propose a utility-based pseudo partition cache partitioning mechanism (UPP). UPP dynamically collects utility information of each thread and shared data, and takes the overall marginal utility as the metric of cache partitioning. Besides, UPP exploits both frequency and recency information of a workload simultaneously, in order to evict dead cachelines early and filter less reused blocks through dynamic insertion and promotion mechanism.

源语言英语
页(从-至)170-180
页数11
期刊Jisuanji Yanjiu yu Fazhan/Computer Research and Development
50
1
出版状态已出版 - 1月 2013
已对外发布

指纹

探究 'A utility based cache optimization mechanism for multi-thread workloads' 的科研主题。它们共同构成独一无二的指纹。

引用此