Generalized supercube: an incrementally expandable interconnection network

Author

Sen, Amnabha ; Sengupta, Abhijit ; Bandyopadhyay, Subu

Author_Institution

Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA

fYear

1990

fDate

8-10 Oct 1990

Firstpage

384

Lastpage

387

Abstract

A class of incrementally expandable interconnection networks with high connectivity and low diameter is introduced for massively parallel and distributed processing. This class of networks can be constructed for any number of computing nodes, and the network size can easily be incremented without a major reconfiguration of the network. The connectivity and the diameter of the network are on the order of the logarithm of the number of nodes. It is shown that the connectivity of the network is equal to the minimum node degree. In this sense the connectivity is optimal. The routing algorithms for the network ar simple to implement

Keywords

distributed processing; multiprocessor interconnection networks; parallel architectures; connectivity; distributed processing; generalised supercube; high connectivity; incrementally expandable; interconnection network; low diameter; massively parallel; minimum node degree; routing algorithms; Computer architecture; Computer networks; Computer science; Fault tolerance; Hypercubes; Multiprocessor interconnection networks; Routing; Telecommunication network reliability; Terminology;

fLanguage

English

Publisher

ieee

Conference_Titel

Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the

Conference_Location

College Park, MD

Print_ISBN

0-8186-2053-6

Type

conf

DOI

10.1109/FMPC.1990.89488

Filename

89488