DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee M.M. | - |
dc.contributor.author | Kim, John Dongjun | - |
dc.contributor.author | Abts D. | - |
dc.contributor.author | Marty M. | - |
dc.contributor.author | Lee J.W. | - |
dc.date.accessioned | 2013-03-29T02:04:12Z | - |
dc.date.available | 2013-03-29T02:04:12Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2010-12-04 | - |
dc.identifier.citation | 43rd Annual IEEE/ACM International Symposium on Microarchitecture, MICRO 2010, v., no., pp.509 - 519 | - |
dc.identifier.issn | 1072-4451 | - |
dc.identifier.uri | http://hdl.handle.net/10203/168049 | - |
dc.description.abstract | Emerging many-core chip multiprocessors will integrate dozens of small processing cores with an on-chip interconnect consisting of point-to-point links. The interconnect enables the processing cores to not only communicate, but to share common resources such as main memory resources and I/O controllers. In this work, we propose an arbitration scheme to enable equality of service (EoS) in access to a chip's shared resources. That is, we seek to remove any bias in a core's access to a shared resource based on its location in the CMP. We propose using probabilistic arbitration combined with distance-based weights to achieve EoS and overcome the limitation of conventional round-robin arbiter. We describe how nonlinear weights need to be used with probabilistic arbiters and propose three different arbitration weight metrics - fixed weight, constantly increasing weight, and variably increasing weight. By only modifying the arbitration of an on-chip router, we do not require any additional buffers or virtual channels and create a simple, low-cost mechanism for achieving EoS. We evaluate our arbitration scheme across a wide range of traffic patterns. In addition to providing EoS, the proposed arbitration has additional benefits which include providing quality-of-service features (such as differentiated service) and providing fairness in terms of both throughput and latency that approaches the global fairness achieved with age-base arbitration - thus, providing a more stable network by achieving high sustained throughput beyond saturation. ? 2010 IEEE. | - |
dc.language | ENG | - |
dc.publisher | IEEE Computer Society | - |
dc.title | Probabilistic distance-based arbitration: Providing equality of service for many-core CMPs | - |
dc.type | Conference | - |
dc.identifier.scopusid | 2-s2.0-79951719950 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 509 | - |
dc.citation.endingpage | 519 | - |
dc.citation.publicationname | 43rd Annual IEEE/ACM International Symposium on Microarchitecture, MICRO 2010 | - |
dc.identifier.conferencecountry | United States | - |
dc.identifier.conferencecountry | United States | - |
dc.contributor.localauthor | Kim, John Dongjun | - |
dc.contributor.nonIdAuthor | Lee M.M. | - |
dc.contributor.nonIdAuthor | Abts D. | - |
dc.contributor.nonIdAuthor | Marty M. | - |
dc.contributor.nonIdAuthor | Lee J.W. | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.