Generalized supercube

An incrementally expandable interconnection network

Arunabha Sen, Abhijit Sengupta, Subir Bandyopadhyay

Research output: Contribution to journalArticle

5 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)338-344
Number of pages7
JournalJournal of Parallel and Distributed Computing
Volume13
Issue number3
DOIs
StatePublished - 1991

Fingerprint

Interconnection Networks
Routing algorithms
Connectivity
Processing
Vertex of a graph
Distributed Processing
Routing Algorithm
Reconfiguration
Parallel Processing
Logarithmic
Computing

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

Generalized supercube : An incrementally expandable interconnection network. / Sen, Arunabha; Sengupta, Abhijit; Bandyopadhyay, Subir.

In: Journal of Parallel and Distributed Computing, Vol. 13, No. 3, 1991, p. 338-344.

Research output: Contribution to journalArticle

Sen, Arunabha ; Sengupta, Abhijit ; Bandyopadhyay, Subir. / Generalized supercube : An incrementally expandable interconnection network. In: Journal of Parallel and Distributed Computing. 1991 ; Vol. 13, No. 3. pp. 338-344.
@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",
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

Y1 - 1991

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

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 -