Title: A deadlock-free routing algorithm using minimum number of virtual channels and application mappings for Hierarchical Torus Network

Authors: M.M. Hafizur Rahman, Susumu Horiguchi

Addresses: Graduate School of Information Science, 1-1 Asahidai, Tatsunokuchi, Ishikawa-923-1292, Japan. ' Graduate School of Information Science, Tohoku University, Aoba 6-3-09, Aramaki, Sendai 980-8579, Japan

Abstract: A Hierarchical Torus Network (HTN) is a 2D-torus network of multiple Basic Modules (BM), in which the BM are 3D-torus networks that are hierarchically interconnected for higher level networks. In this paper, we present a deadlock-free dimension-order routing using minimum number of Virtual Channels and evaluate the network|s dynamic communication performance under the uniform traffic pattern by computer simulation and compare it with other contemporary conventional and hierarchical networks. We find that the dynamic communication performance of the HTN is better than that of the H3D-mesh, TESH, mesh, and torus networks. We also present the mapping of some primitive applications on the HTN. It is shown that the number of communication steps for various advanced applications mapping on the HTN is lower than that of those networks.

Keywords: hierarchical torus networks; HTN; wormhole routing; deadlock free routing; uniform traffic patterns; dynamic communication performance; bitonic merge; fast Fourier transform; FFT; finding the maximum; virtual channels.

DOI: 10.1504/IJHPCN.2006.010639

International Journal of High Performance Computing and Networking, 2006 Vol.4 No.3/4, pp.174 - 187

Published online: 10 Aug 2006 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article