The Effect of Network Topology and Channel Labels on the Performance of Label-Based Routing Algorithms

Authors:
Reza Moraveji;Hamid Sarbazi-Azad;Arash Tavakkol
Affiliations:
IPM School of Computer Science, Tehran, Iran and Dept. of ECE, Shahid Beheshti Univ., Tehran, Iran;IPM School of Computer Science, Tehran, Iran and Dept. of Computer Engineering, Sharif Univ., Tehran, Iran;IPM School of Computer Science, Tehran, Iran
Venue:
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Year:
2008

Citing 6
Cited 0

Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
L-Turn Routing: An Adaptive Routing in Irregular Networks

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
An Effective Methodology to Improve the Performance of the Up*/Down* Routing Algorithm

IEEE Transactions on Parallel and Distributed Systems
Layered Routing in Irregular Networks

IEEE Transactions on Parallel and Distributed Systems
High-performance adaptive routing for networks with arbitrary topology

Journal of Systems Architecture: the EUROMICRO Journal
Performance modeling of wormhole hypermeshes under hotspot traffic

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Designing an efficient deadlock-free routing is a point of concern for irregular topologies. In this paper, we take a step toward the goal by developing three novel deadlock-free routing algorithms in the content of a new family of algorithms called label-based routing algorithms for irregular topologies. In addition, the newly proposed family covers three previously reported routing algorithms [2, 3]. Moreover, by simulating and comparing the newly and traditional proposed routing methods, it is shown that the performance of this family highly depends on the network topology and channel labeling process.