TESH: A New Hierarchical Interconnection Network for Massively Parallel Computing

Vijay K. JAIN; Tadasse GHIRMAI; Susumu HORIGUCHI

k-ary n-cube connection of supernodes that comprise meshes of lower level nodes. Its key features are the following: it is hierarchical, thus allowing exploitation of computation locality as well as easy expansion (up to a million processors), and it appears to be well suited for 3-D VLSI implementation, for it requires far fewer number of vertical wires than almost all known multi-computer networks. Presented in the paper are the architecture of the new network, node addressing and message routing, 3-D VLSI/ULSI considerations, and application of the network to massively parallel computing. Specifically, we discuss the mapping on to the network of stack filtering, a hardware oriented technique for order statistic image filtering." />

TESH: A New Hierarchical Interconnection Network for Massively Parallel Computing

Vijay K. JAIN  Tadasse GHIRMAI  Susumu HORIGUCHI

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E80-D   No.9   pp.837-846
Publication Date: 1997/09/25
Online ISSN:
DOI:
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Issue on Architectures, Algorithms and Networks for Massively Parallel Computing)
Category: Interconnection Networks
Keyword:
parallel computing,  interconnection networks,  hierarchical networks,  tori-connected meshes (TESH),  very large scale integration (VLSI),  ultra large scale integration (ULSI),  3-D computer,  stacked silicon planes,

Full Text: PDF>>

Summary:
Advanced scientific and engineering problems require massively parallel computing. Critical to the design

and ultimately the performance

of such computing systems is the interconnection network binding the computing elements, just as is the cardiovascular network to the human body. This paper develops a new interconnection network, "Tori connected mESHes (TESH)," consisting of k-ary n-cube connection of supernodes that comprise meshes of lower level nodes. Its key features are the following: it is hierarchical, thus allowing exploitation of computation locality as well as easy expansion (up to a million processors), and it appears to be well suited for 3-D VLSI implementation, for it requires far fewer number of vertical wires than almost all known multi-computer networks. Presented in the paper are the architecture of the new network, node addressing and message routing, 3-D VLSI/ULSI considerations, and application of the network to massively parallel computing. Specifically, we discuss the mapping on to the network of stack filtering, a hardware oriented technique for order statistic image filtering.