Modified Hierarchical 3D-Torus Network

Authors:
M.M. Hafizur Rahman;Yasushi Inoguchi;Susumu Horiguchi
Affiliations:
The author is with the Graduate School of Information Science, JAIST, Ishikawa-ken, 923-1292 Japan. E-mail: rahman@jaist.ac.jp,;The author is with the Center for Information Science, JAIST, Ishikawa-ken, 923-1292 Japan.,;The author is with the Graduate School of Information Science, Tohoku University, Sendai-shi, 980-8579 Japan.
Venue:
IEICE - Transactions on Information and Systems
Year:
2005

Citing 0
Cited 6

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

International Journal of High Performance Computing and Networking
Multilevel network characterization using regular topologies

Computer Networks: The International Journal of Computer and Telecommunications Networking
Research on next-generation scalable routers implemented with H-Torus topology

Journal of Computer Science and Technology
Regular topologies application on multilevel networks

PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
A class of hierarchical graphs as topologies for interconnection networks

Theoretical Computer Science
High and stable performance under adverse traffic patterns of tori-connected torus network

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Three-dimensional (3D) wafer stacked implementation (WSI) has been proposed as a promising technology for massively parallel computers. A hierarchical 3D-torus (H3DT) network, which is a 3D-torus network of multiple basic modules in which the basic modules are 3D-mesh networks, has been proposed for efficient 3D-WSI. However, the restricted use of physical links between basic modules in the higher level networks reduces the dynamic communication performance of this network. A torus network has better dynamic communication performance than a mesh network. Therefore, we have modified the H3DT network by replacing the 3D-mesh modules by 3D-tori, calling it a Modified H3DT (MH3DT) network. This paper addresses the architectural details of theMH3DT network and explores aspects such as degree, diameter, cost, average distance, arc connectivity, bisection width, and wiring complexity. We also present a deadlock-free routing algorithm for the MH3DT network using two virtual channels and evaluate the network's dynamic communication performance under the uniform traffic pattern, using the proposed routing algorithm. It is shown that the MH3DT network possesses several attractive features including small diameter, small cost, small average distance, better bisection width, and better dynamic communication performance.