The Community for Technology Leaders
Green Image
Issue No. 01 - January/February (2011 vol. 31)
ISSN: 0272-1732
pp: 78-89
Onur Mutlu , Carnegie Mellon University
Michael Papamichael , Carnegie Mellon University
Yoongu Kim , Carnegie Mellon University
Mor Harchol-Balter , Carnegie Mellon University
<p>Memory schedulers in multicore systems should carefully schedule memory requests from different threads to ensure high system performance and fair, fast progress of each thread. No existing memory scheduler provides both the highest system performance and highest fairness. Thread Cluster Memory scheduling is a new algorithm that achieves the best of both worlds by differentiating latency-sensitive threads from bandwidth-sensitive ones and employing different scheduling policies for each.</p>
Memory controller, memory scheduling algorithms, thread cluster, latency-sensitive threads, bandwidth-sensitive threads, memory intensity, row-buffer locality, bank-level parallelism, memory-level parallelism, fairness, system throughput, multicore, multithreaded systems, multiprocessors, quality of service
Onur Mutlu, Michael Papamichael, Yoongu Kim, Mor Harchol-Balter, "Thread Cluster Memory Scheduling", IEEE Micro, vol. 31, no. , pp. 78-89, January/February 2011, doi:10.1109/MM.2011.15
101 ms
(Ver 3.3 (11022016))