Memory access scheduling based on dynamic multilevel priority in shared DRAM systems

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Interapplication interference at shared main memory severely degrades performance and increasing DRAM frequency calls for simple memory schedulers. Previous memory schedulers employaper-application ranking scheme for high system performance or a per-group ranking scheme for low hardware cost, but few provide a balance. We propose DMPS, a memory scheduler based on dynamic multilevel priority. First, DMPS uses "memory occupancy" to measure interference quantitatively. Second, DMPS groups applications, favors latency-sensitive groups, and dynamically prioritizes applications by employing a per-level ranking scheme. The simulation results show that DMPS has 7.2% better system performance and 22% better fairness over FRFCFS at low hardware complexity and cost.

Cite

CITATION STYLE

APA

Xiong, D., Huang, K., Jiang, X., & Yan, X. (2016). Memory access scheduling based on dynamic multilevel priority in shared DRAM systems. ACM Transactions on Architecture and Code Optimization, 13(4). https://doi.org/10.1145/3007647

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free