BARP-A Dynamic Routing Protocol for Balanced Distribution of Traffic in NoCs
- 1 March 2008
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15301591,p. 1408-1413
- https://doi.org/10.1109/date.2008.4484871
Abstract
A novel routing algorithm, named balanced adaptive routing protocol (BARP), is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time. By evenly distributing input packets of a router among all its shortest path output ports, a novel adaptive routing protocol for avoiding congestion condition emerges. It is observed that BARP can achieve better performance compared to static XY routing, odd- even routing and dynamic XY routing.Keywords
This publication has 12 references indexed in Scilit:
- Distributing Congestions in NoCs through a Dynamic Routing Algorithm based on Input and Output SelectionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- DyXYPublished by Association for Computing Machinery (ACM) ,2006
- DyADPublished by Association for Computing Machinery (ACM) ,2004
- Efficient fully adaptive wormhole routing in n-dimensional meshesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Networks on chips: a new SoC paradigmComputer, 2002
- Route packets, net wiresPublished by Association for Computing Machinery (ACM) ,2001
- The odd-even turn model for adaptive routingIEEE Transactions on Parallel and Distributed Systems, 2000
- Multicast communication in multicomputer networksIEEE Transactions on Parallel and Distributed Systems, 1993
- A survey of wormhole routing techniques in direct networksComputer, 1993
- The turn model for adaptive routingACM SIGARCH Computer Architecture News, 1992