Fair Queuing Memory Systems
2006pp. 208–222
Citations Over TimeTop 1% of 2006 papers
Abstract
We propose and evaluate a multi-thread memory scheduler that targets high performance CMPs. The proposed memory scheduler is based on concepts originally developed for network fair queuing scheduling algorithms. The memory scheduler is fair and provides quality of service (QoS) while improving system performance. On a four processor CMP running workloads containing a mix of applications with a range of memory bandwidth demands, the proposed memory scheduler provides QoS to all of the threads in all of the workloads, improves system performance by an average of 14% (41% in the best case), and reduces the variance in the threads' target memory bandwidth utilization from .2 to .0058
Related Papers
- Dynamic Memory Allocation: Role in Memory Management(2014)
- → Memory-Aware Management for Heterogeneous Main Memory Using an Optimization of the Aging Paging Algorithm(2016)1 cited
- Research of high efficient implementation of memory management mechanism(2009)
- Dynamic Memory Allocation: Role in Memory Management(2014)