TY - GEN
T1 - A fair thread-aware memory scheduling algorithm for chip multiprocessor
AU - Zhu, Danfeng
AU - Wang, Rui
AU - Wang, Hui
AU - Qian, Depei
AU - Luan, Zhongzhi
AU - Chu, Tianshu
PY - 2010
Y1 - 2010
N2 - In Chip multiprocessor (CMP) systems, DRAM memory is a critical resource shared among cores. Scheduled by one single memory controller, memory access requests from different cores may interfere with each other. This interference causes extra waiting time for threads and leads to negligible overall system performance loss. In conventional thread-unaware memory scheduling patterns, different threads probably experience extremely different performance; one thread is starving severely while another is continuously served. Therefore, fairness should also be considered besides data throughput in CMP memory access scheduling to maintain the overall system performance. This paper proposes a Fair Thread-Aware Memory scheduling algorithm (FTAM) that ensures both the fairness and memory system performance. FTAM algorithm schedules requests from different threads by considering multiple factors, including the source thread information, the arriving time and the serving history of each thread. As such FTAM considers the memory characteristic of each thread while maintains a good fairness among threads to avoid performance loss. Simulation shows that FTAM significantly improves the system fairness by decreasing the unfairness index from 0.39 to 0.08 without sacrificing data throughput compared with conventional scheduling algorithm.
AB - In Chip multiprocessor (CMP) systems, DRAM memory is a critical resource shared among cores. Scheduled by one single memory controller, memory access requests from different cores may interfere with each other. This interference causes extra waiting time for threads and leads to negligible overall system performance loss. In conventional thread-unaware memory scheduling patterns, different threads probably experience extremely different performance; one thread is starving severely while another is continuously served. Therefore, fairness should also be considered besides data throughput in CMP memory access scheduling to maintain the overall system performance. This paper proposes a Fair Thread-Aware Memory scheduling algorithm (FTAM) that ensures both the fairness and memory system performance. FTAM algorithm schedules requests from different threads by considering multiple factors, including the source thread information, the arriving time and the serving history of each thread. As such FTAM considers the memory characteristic of each thread while maintains a good fairness among threads to avoid performance loss. Simulation shows that FTAM significantly improves the system fairness by decreasing the unfairness index from 0.39 to 0.08 without sacrificing data throughput compared with conventional scheduling algorithm.
UR - https://www.scopus.com/pages/publications/79956282193
U2 - 10.1007/978-3-642-13119-6_15
DO - 10.1007/978-3-642-13119-6_15
M3 - 会议稿件
AN - SCOPUS:79956282193
SN - 3642131182
SN - 9783642131189
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 174
EP - 185
BT - Algorithms and Architectures for Parallel Processing - 10th International Conference, ICA3PP 2010, Proceedings
T2 - 10th International Conference Algorithms and Architectures for Parallel Processing, ICA3PP 2010
Y2 - 21 May 2010 through 23 May 2010
ER -