The Community for Technology Leaders
2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT) (2010)
Vienna, Austria
Sept. 11, 2010 to Sept. 15, 2010
ISBN: 978-1-5090-5032-1
pp: 575-576
Michael M. Lee , KAIST, Daejeon, Korea
John Kim , KAIST, Daejeon, Korea
Dennis Abts , Google Inc., Madison, WI, USA
Michael Marty , Google Inc., Madison, WI, USA
Jae W. Lee , Parakinetics Inc., Princeton, NJ, USA
ABSTRACT
The on-chip network of emerging many-core CMPs enables the sharing of numerous on-chip components. This on-chip network needs to ensure fairness when accessing the shared resources. In this work, we propose providing equality of service (EoS) in future many-core CMPs on-chip networks by leveraging distance, or hop count, to approximate the age of packets in the network. We propose 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 complexity-effective mechanism for achieving EoS.
INDEX TERMS
fairness, on-chip network, age-based arbitration
CITATION
Michael M. Lee, John Kim, Dennis Abts, Michael Marty, Jae W. Lee, "Approximating age-based arbitration in on-chip networks", 2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT), vol. 00, no. , pp. 575-576, 2010, doi:
95 ms
(Ver 3.3 (11022016))