A new selection policy for adaptive routing in network on chip

Authors:
Giuseppe Ascia;Vincenzo Catania;Maurizio Palesi;Davide Patti
Affiliations:
University of Catania, Dipartimento di Ingegneria Informatica e delle Telecomunicazioni, Catania, Italy;University of Catania, Dipartimento di Ingegneria Informatica e delle Telecomunicazioni, Catania, Italy;University of Catania, Dipartimento di Ingegneria Informatica e delle Telecomunicazioni, Catania, Italy;University of Catania, Dipartimento di Ingegneria Informatica e delle Telecomunicazioni, Catania, Italy
Venue:
EHAC'06 Proceedings of the 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Year:
2006

Citing 7
Cited 2

The turn model for adaptive routing

Journal of the ACM (JACM)
Wormhole routing techniques for directly connected multicomputer systems

ACM Computing Surveys (CSUR)
The Odd-Even Turn Model for Adaptive Routing

IEEE Transactions on Parallel and Distributed Systems
Route packets, not wires: on-chip inteconnection networks

Proceedings of the 38th annual Design Automation Conference
A Network on Chip Architecture and Design Methodology

ISVLSI '02 Proceedings of the IEEE Computer Society Annual Symposium on VLSI
Packetization and routing analysis of on-chip multiprocessor networks

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Networks on chip
DyAD: smart routing for networks-on-chip

Proceedings of the 41st annual Design Automation Conference

An improved algorithm for slot selection in the Æthereal network-on-chip

Proceedings of the Fifth International Workshop on Interconnection Network Architecture: On-Chip, Multi-Chip
A TDM slot allocation flow based on multipath routing in NoCs

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient and deadlock-free routing is critical to the performance of networks-on-chip. In this paper we present a new selection policy that can be coupled to any adaptive routing algorithm to improve the performance in terms of average delay. The proposed approach introduce the concept of Neighbors-on-Path to exploit the situations of indecision occurring when the routing function returns several admissible output channels. A selection strategy is developed with the aim to choose the channel that will allow the packet to be routed to its destination along a path that is as free as possible of congested nodes. Experimental comparisons between the proposed approach against both the deterministic XY routing and current state-of-the-art of adaptive routing algorithm for different traffic scenarios show an improvement in terms of saturation point respectively of 36% and almost 10% in average.