By Topic

Recursive hierarchical fully-connected networks: a class of low-degree small-diameter interconnection networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chi-Hsiang Yeh ; Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA ; Parhami

The authors propose a new class of interconnection networks called recursive hierarchical fully-connected (RHFC) networks for high-performance parallel processing. The degree of a partially linked RHFC network is equal to that of its nucleus graph plus a fixed integer, leading to the scalability of such networks. The diameters of suitably constructed RHFC networks are asymptotically optimal within a small constant factor with respect to their node degrees. They then present the construction of recursive hierarchical swapped (RES) networks and multi-dimensional hypernets, both of which are subclasses of RHFC networks and can emulate a hypercube efficiently. They conclude that RHFC networks are highly modularized, make the use of fixed-degree building blocks possible for any practically realizable system, and lead to the construction of high-performance interconnection networks with reasonable cost

Published in:

Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on

Date of Conference:

11-13 Jun 1996