Generalized hierarchical completely-connected networks

Author

Takabatake, Toshinori ; Kaneko, Keiichi ; Ito, Hideo

Author_Institution

Graduate Sch. of Sci. & Technol., Chiba Univ., Japan

fYear

1999

fDate

1999

Firstpage

68

Lastpage

73

Abstract

A novel network structure called generalized Hierarchical Completely-Connected networks (HCC) is proposed, and its properties and features are evaluated. A set of the HCCs constructed by the proposed method includes some conventional hierarchical networks (then it is called generalized). The construction of an HCC is started from a basic block (a level-1 block) which consists of n nodes with a constant degree. Then a level-h (h⩾2) block is constructed recursively by interconnecting any pair of macro nodes (n level-(h-1) blocks) completely. An HCC has the constant node degree regardless of increasing its size (the number of nodes). Furthermore, since an HCC has a hierarchically structured character and the feature of uniformity, a wide variety of inter-cluster connections are possible

Keywords

graph theory; multiprocessor interconnection networks; parallel architectures; HCC; HCCs; constant node degree; conventional hierarchical networks; generalized hierarchical completely-connected networks; hierarchically structured character; inter-cluster connections; level-1 block; macro node interconnection; network structure; recursive construction; uniformity;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms, and Networks, 1999. (I-SPAN '99) Proceedings. Fourth InternationalSymposium on

Conference_Location

Perth/Fremantle, WA

ISSN

1087-4089

Print_ISBN

0-7695-0231-8

Type

conf

DOI

10.1109/ISPAN.1999.778919

Filename

778919