A New Routing Algorithm in Triple-Based Hierarchical Interconnection Network

Authors:
Qiao Baojun;Shi Feng;Ji Weixing
Affiliations:
Beijing Institute of Technology, China;Beijing Institute of Technology, China;Beijing Institute of Technology, China
Venue:
ICICIC '06 Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1
Year:
2006

Citing 0
Cited 2

TriBA: a novel scalable architecture for high performance parallel computing applications

ACOS'07 Proceedings of the 6th Conference on WSEAS International Conference on Applied Computer Science - Volume 6
Triplet-based topology for on-chip networks

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Triple-based hierarchical interconnection network (THIN) is not only a new kind of direct networks but also a kind of HIN's. Efficient routing algorithm is very essential to the performance of the interconnection network and the parallel computing system. This paper presents DDRA (Distributed Deterministic Routing Algorithm) routing algorithm in triple-based hierarchical interconnection network. Fully applying the hierarchical characteristic of the network, DDRA routing algorithm just uses the node address to determine an approximate minimal path between source and destination node, without constructing the route table on each node. The analysis based on the simulation of DDRA shows it is not only very simple and easy to be implemented in hardware, but has high efficiency.