loading...
Fair Queuing Memory Systems
Orlando, Florida, USA December 09-December 13
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MICRO.2006.2439th Annual IEEE/ACM International Sy ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Kyle J. Nesbit, University of Wisconsin, Madison
Nidhi Aggarwal, University of Wisconsin, Madison
James Laudon, Sun Microsystems, Inc.
James E. Smith, University of Wisconsin, Madison
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.
Citation:
Kyle J. Nesbit, Nidhi Aggarwal, James Laudon, James E. Smith, "Fair Queuing Memory Systems," micro, pp.208-222, 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.