Improved Flow Control for Minimal Fully Adaptive Routing in 2D Mesh NoC
Open Access
- 15 October 2016
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 9-14
Abstract
Routing algorithm has a significant impact on the overall performance of network-on-chip (NoC) based system due to the unbalanced nature of NoC traffic. In this paper, we propose an improved flow control for implementing fully adaptive routing algorithm on 2D mesh based NoC. Our proposed NoC router allows packet exchanges from escape virtual channels (EVCs) to adaptive VCs (AVCs). It also relaxes the atomic VC reallocation constraint for all EVCs as well as AVCs, which are located in router's local, east and west ports of the router. This approach guarantees that the abovementioned conditions still result in a deadlock-free routing. The proposed fully adaptive NoC outperforms the conventional fully adaptive router and partially adaptive router that uses odd-even routing by 80% and 25% higher average saturation injection ratio, respectively.Keywords
Funding Information
- CREST grant (UTM vote no. 4B176)
- Universiti Teknologi Malaysia Matching grant (UTM vote no 00M75)
This publication has 20 references indexed in Scilit:
- The Hamiltonian-based odd–even turn model for maximally adaptive routing in 2D mesh networks-on-chipComputers and Electrical Engineering, 2015
- Low Latency Network-on-Chip Router Microarchitecture Using Request Masking TechniqueInternational Journal of Reconfigurable Computing, 2015
- Virtual networks -- distributed communication resource managementACM Transactions on Reconfigurable Technology and Systems, 2013
- EDXY – A low cost congestion-aware routing algorithm for network-on-chipsJournal of Systems Architecture, 2010
- Globally Adaptive Load-Balanced Routing on ToriIEEE Computer Architecture Letters, 2004
- A general theory for deadlock-free adaptive routing using a mixed set of resourcesIEEE Transactions on Parallel and Distributed Systems, 2001
- The odd-even turn model for adaptive routingIEEE Transactions on Parallel and Distributed Systems, 2000
- A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networksIEEE Transactions on Parallel and Distributed Systems, 1995
- A new theory of deadlock-free adaptive routing in wormhole networksIEEE Transactions on Parallel and Distributed Systems, 1993
- The turn model for adaptive routing1992