2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT) (2010)
Sept. 11, 2010 to Sept. 15, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/
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
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.
fairness, on-chip network, age-based arbitration
M. M. Lee, J. Kim, D. Abts, M. Marty and J. W. Lee, "Approximating age-based arbitration in on-chip networks," 2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT), Vienna, Austria, 2010, pp. 575-576.