Adaptive Reordering Scheduling Mechanism of Memory Access
Chaohuan Hou · Jisuanji gongcheng · 2009
Speed of memory access is a bottleneck in modern computer system. The out-of-order scheduling of memory access can improve bus utilization of memory effectively. Based on a reordering mechanism called burst scheduling, this paper proposes a priority formula to select the most appropriate burst in each bank to access memory, and an adaptive mechanism is introduced to adjust coefficients of priority formula to adapt different applications. Compared with conventional in-order memory access and burst scheduling, the adaptive mechanism improves bus utilization by 52% and 4.8% respectively, by running SPEC CPU2000 benchmarks and stream.