Generalized supercube: An incrementally expandable interconnection network

Arunabha Sen; Abhijit Sengupta; Subir Bandyopadhyay

doi:10.1016/0743-7315(91)90081-J

Generalized supercube: An incrementally expandable interconnection network

Arunabha Sen, Abhijit Sengupta, Subir Bandyopadhyay

IAFSE-CIDSE: Computer Science and Engineering

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

A new class of incrementally expandable interconnection networks with high connectivity and low diameter is introduced in this paper 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 undergoing a major reconfiguration of the network. The connectivity and the diameter of the network are logarithmic orders of the number of nodes. It has been 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 are simple to implement.

Original language	English (US)
Pages (from-to)	338-344
Number of pages	7
Journal	Journal of Parallel and Distributed Computing
Volume	13
Issue number	3
DOIs	https://doi.org/10.1016/0743-7315(91)90081-J
State	Published - Nov 1991

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications
Artificial Intelligence

Access to Document

10.1016/0743-7315(91)90081-J

Fingerprint Dive into the research topics of 'Generalized supercube: An incrementally expandable interconnection network'. Together they form a unique fingerprint.

Cite this

@article{62d29d7e4083494da0d9289fccdd6957,

title = "Generalized supercube: An incrementally expandable interconnection network",

abstract = "A new class of incrementally expandable interconnection networks with high connectivity and low diameter is introduced in this paper 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 undergoing a major reconfiguration of the network. The connectivity and the diameter of the network are logarithmic orders of the number of nodes. It has been 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 are simple to implement.",

author = "Arunabha Sen and Abhijit Sengupta and Subir Bandyopadhyay",

year = "1991",

month = nov,

doi = "10.1016/0743-7315(91)90081-J",

language = "English (US)",

volume = "13",

pages = "338--344",

journal = "Journal of Parallel and Distributed Computing",

issn = "0743-7315",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Generalized supercube

T2 - An incrementally expandable interconnection network

AU - Sen, Arunabha

AU - Sengupta, Abhijit

AU - Bandyopadhyay, Subir

PY - 1991/11

Y1 - 1991/11

N2 - A new class of incrementally expandable interconnection networks with high connectivity and low diameter is introduced in this paper 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 undergoing a major reconfiguration of the network. The connectivity and the diameter of the network are logarithmic orders of the number of nodes. It has been 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 are simple to implement.

AB - A new class of incrementally expandable interconnection networks with high connectivity and low diameter is introduced in this paper 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 undergoing a major reconfiguration of the network. The connectivity and the diameter of the network are logarithmic orders of the number of nodes. It has been 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 are simple to implement.

UR - http://www.scopus.com/inward/record.url?scp=0026259766&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026259766&partnerID=8YFLogxK

U2 - 10.1016/0743-7315(91)90081-J

DO - 10.1016/0743-7315(91)90081-J

M3 - Article

AN - SCOPUS:0026259766

VL - 13

SP - 338

EP - 344

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 3

ER -

Generalized supercube: An incrementally expandable interconnection network

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this