TY - GEN
T1 - Interference-aware program scheduling for multicore processors
AU - Wang, Lin
AU - Wang, Rui
AU - Fu, Cuijiao
AU - Luan, Zhongzhi
AU - Qian, Depei
PY - 2013
Y1 - 2013
N2 - Running multiple application programs on a multicore processor can maximize processor resources utilization. However, contention to the shared resources may result in interference among co-running programs, and make the program performance unstable and unpredictable. In order to optimize the performance of co-running programs and ensure the QoS of latency-sensitive applications, we propose an interference-aware scheduling strategy IA for systems based on multicore processors. Our work begins with analysis of the behavior of a set of benchmark programs, after that we train a simple program classifier. We use this classifier to classify the benchmark programs into three categories according to their interference with each other. The interferenceaware scheduler tries to schedule the programs with less interference to the same multicore processor. Experiments results show that our method improves system performance while maintaining reasonable resource utilization. It outperforms the previously published scheduling strategy in guaranteeing the QoS of latency-sensitive applications.
AB - Running multiple application programs on a multicore processor can maximize processor resources utilization. However, contention to the shared resources may result in interference among co-running programs, and make the program performance unstable and unpredictable. In order to optimize the performance of co-running programs and ensure the QoS of latency-sensitive applications, we propose an interference-aware scheduling strategy IA for systems based on multicore processors. Our work begins with analysis of the behavior of a set of benchmark programs, after that we train a simple program classifier. We use this classifier to classify the benchmark programs into three categories according to their interference with each other. The interferenceaware scheduler tries to schedule the programs with less interference to the same multicore processor. Experiments results show that our method improves system performance while maintaining reasonable resource utilization. It outperforms the previously published scheduling strategy in guaranteeing the QoS of latency-sensitive applications.
UR - https://www.scopus.com/pages/publications/84892848791
U2 - 10.1007/978-3-319-03859-9_38
DO - 10.1007/978-3-319-03859-9_38
M3 - 会议稿件
AN - SCOPUS:84892848791
SN - 9783319038582
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 436
EP - 445
BT - Algorithms and Architectures for Parallel Processing - 13th International Conference, ICA3PP 2013, Proceedings
T2 - 13th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2013
Y2 - 18 December 2013 through 20 December 2013
ER -