Title
Probabilistic odd---even: an adaptive wormhole routing algorithm for 2D mesh network-on-chip
Abstract
Wormhole routing is a popular routing technique used in network-on-chip. It is efficient but susceptible to deadlock, while deadlock will significantly degrade the network performance of NoC. Most existing adaptive wormhole routings avoid deadlock by reducing the degree of adaptiveness and thus sacrificing network performance. In this paper, we address both deadlock and network performance issues jointly, and propose a probabilistic odd---even (POE) routing algorithm that achieves the minimum packet delivery delay. The proposed POE dynamically adjusts the probabilities of constrained turns that may lead to deadlocks according to the current network conditions, and uses an efficient deadlock detection and recovery scheme when a deadlock happens. By adopting constrained turns adaptively to the network status, it not only reduces the frequency of deadlock and allows the network to be swiftly recovered when it occurs, but also greatly improves the degree of adaptiveness to obtain high network performance. Experimental results show that our method achieves a significant performance improvement both in terms of network throughput and average packet latency compared with the existing methods such as XY, odd---even, abacus turn model and fully adaptive routing algorithm while it only has moderate energy consumption.
Year
DOI
Venue
2014
10.1007/s11227-014-1250-6
The Journal of Supercomputing
Keywords
Field
DocType
routing adaptiveness,probabilistic odd---even routing,deadlock,network-on-chip,convex optimization
Static routing,Computer science,Parallel computing,Network packet,Deadlock,Network on a chip,Computer network,Throughput,Deadlock prevention algorithms,Performance improvement,Network performance,Distributed computing
Journal
Volume
Issue
ISSN
70
1
1573-0484
Citations 
PageRank 
References 
0
0.34
26
Authors
4
Name
Order
Citations
PageRank
Su Hu141.12
Wenzheng Xu200.34
Jing Lin300.34
Xiaola Lin4109978.09