Routing performance enhancement in hierarchical torus network by link-selection algorithm

Authors:
M. M. Hafizur Rahman;Susumu Horiguchi
Affiliations:
Graduate School of Information Science, JAIST, Nomi-shi, Ishikawa-923-1292, Japan;Graduate School of Information Science, Tohoku University, Aoba 09, Aramaki, Sendai 980-8579, Japan
Venue:
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Year:
2005

Citing 8
Cited 0

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
Performance Analysis of k-ary n-cube Interconnection Networks

IEEE Transactions on Computers
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
A necessary and sufficient condition for deadlock-free wormhole routing

Journal of Parallel and Distributed Computing
A Cost and Speed Model for k-ary n-Cube Wormhole Routers

IEEE Transactions on Parallel and Distributed Systems
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
System Effects of Interprocessor Communication Latency in Multicomputers

IEEE Micro
K-ary N-trees: High Performance Networks for Massively Parallel Architectures

K-ary N-trees: High Performance Networks for Massively Parallel Architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

A hierarchical torus network (HTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 3D-torus networks that are hierarchically interconnected for higher-level networks. The static network performance of the HTN and its dynamic communication performance using the popular dimension-order routing algorithm have already been evaluated and shown to be superior to the performance of other conventional and hierarchical interconnection networks. In this paper, we propose a link-selection algorithm for efficient use of physical links of the HTN, while keeping the link-selection algorithm as simple as the dimension-order routing algorithm. We also prove that the proposed algorithm for the HTN is deadlock-free using three virtual channels. We evaluate the dynamic communication performance of an HTN using dimension-order routing and link-selection algorithms under various traffic patterns. We find that the dynamic communication performance of an HTN using the link-selection algorithm is better than when the dimension-order routing algorithm is used.