PARS: A scheduling of periodically active rank to optimize power efficiency for main memory
Jia, G. J.
; Han, G. H.
; Jiang, J. J.
Rodrigues, J. R.
Journal of Network and Computer Applications Vol. 58, Nº 1, pp. 327 - 336, December, 2015.
ISSN (print): 1095-8592
ISSN (online): 1084-8045
Journal Impact Factor: 2,229 (in 2014)
Digital Object Identifier: 10.1016/j.jnca.2015.08.001
Download Full text PDF ( 1 MB)
The growing gap between microprocessor speed and DRAM speed is a major problem that computer designers are facing. In order to narrow the gap, main memory is expected to grow significantly in both speed and capacity for it is a major shared resource among cores in a multi-core system, which will lead to increasing power consumption, perhaps replacing the dominant consuming fraction of processor. Therefore, it is critical to address the power issue without seriously decreasing performance in the main memory subsystem. In this paper, we propose a periodically active rank scheduling (PARS) to optimize power efficiency for DRAM in smart phones. Our scheduling features a three-step design. First, we partition all threads in the system into groups. Second, we modify page allocation policy to achieve threads in the same group which occupies the same rank but different banks of DRAM. Finally, we sequentially schedule threads in one group after another while only active running group's ranks to retain other ranks low power status. As a result, our scheduling periodically activates one rank after another to optimize memory power efficiency. We implement PARS in Linux 2.6.39 kernel running randomly generated workloads containing single-threaded and multi-threaded benchmark. Experimental results show that PARS can improve both the memory power efficiency by 26.8% and performance by 4.2% average relative to default system while reducing negligible fairness.