The Hyperstar Interconnection Network

Abdel Elah Al-Ayyoub, Khaled Day

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

In this paper, a multiprocessor interconnection topology, the hyperstar, based on the Cartesian product of star graphs is studied. The basic properties of the hyperstar are discussed and proved. This includes reduced degree and diameter, hierarchical structure, vertex symmetry, optimal routing, and shortest path characterization. The hyperstar is shown to be a member of the Cayley class of symmetric graphs. Embeddings of hypercubes, star graphs, and meshes are discussed. An optimal one-to-all broadcasting algorithm is obtained and analyzed. Some results on fault tolerance, parallel paths, Hamiltonian cycles, and VLSI layouts are obtained. Furthermore, a comparative study between the hyperstar and seven related networks is conducted. The comparison is based on scalability, broadcasting cost, link requirements, cost/performance ratio, and other static parameters such as degree, diameter, and average diameter.

Original languageEnglish
Pages (from-to)175-199
Number of pages25
JournalJournal of Parallel and Distributed Computing
Volume48
Issue number2
DOIs
Publication statusPublished - Feb 1 1998

Fingerprint

Interconnection Networks
Broadcasting
Stars
Star Graph
Hamiltonians
Fault tolerance
VLSI Layout
Telecommunication links
Symmetric Graph
Scalability
Costs
Hamiltonian circuit
Cayley
Topology
Cartesian product
Hierarchical Structure
Multiprocessor
Hypercube
Fault Tolerance
Interconnection

Keywords

  • Cartesian product networks; embedding; interconnection networks; star graph.

ASJC Scopus subject areas

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

Cite this

The Hyperstar Interconnection Network. / Al-Ayyoub, Abdel Elah; Day, Khaled.

In: Journal of Parallel and Distributed Computing, Vol. 48, No. 2, 01.02.1998, p. 175-199.

Research output: Contribution to journalArticle

Al-Ayyoub, Abdel Elah ; Day, Khaled. / The Hyperstar Interconnection Network. In: Journal of Parallel and Distributed Computing. 1998 ; Vol. 48, No. 2. pp. 175-199.
@article{9e84ea0b715142f2ab7c11097214ae6e,
title = "The Hyperstar Interconnection Network",
abstract = "In this paper, a multiprocessor interconnection topology, the hyperstar, based on the Cartesian product of star graphs is studied. The basic properties of the hyperstar are discussed and proved. This includes reduced degree and diameter, hierarchical structure, vertex symmetry, optimal routing, and shortest path characterization. The hyperstar is shown to be a member of the Cayley class of symmetric graphs. Embeddings of hypercubes, star graphs, and meshes are discussed. An optimal one-to-all broadcasting algorithm is obtained and analyzed. Some results on fault tolerance, parallel paths, Hamiltonian cycles, and VLSI layouts are obtained. Furthermore, a comparative study between the hyperstar and seven related networks is conducted. The comparison is based on scalability, broadcasting cost, link requirements, cost/performance ratio, and other static parameters such as degree, diameter, and average diameter.",
keywords = "Cartesian product networks; embedding; interconnection networks; star graph.",
author = "Al-Ayyoub, {Abdel Elah} and Khaled Day",
year = "1998",
month = "2",
day = "1",
doi = "10.1006/jpdc.1997.1414",
language = "English",
volume = "48",
pages = "175--199",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - The Hyperstar Interconnection Network

AU - Al-Ayyoub, Abdel Elah

AU - Day, Khaled

PY - 1998/2/1

Y1 - 1998/2/1

N2 - In this paper, a multiprocessor interconnection topology, the hyperstar, based on the Cartesian product of star graphs is studied. The basic properties of the hyperstar are discussed and proved. This includes reduced degree and diameter, hierarchical structure, vertex symmetry, optimal routing, and shortest path characterization. The hyperstar is shown to be a member of the Cayley class of symmetric graphs. Embeddings of hypercubes, star graphs, and meshes are discussed. An optimal one-to-all broadcasting algorithm is obtained and analyzed. Some results on fault tolerance, parallel paths, Hamiltonian cycles, and VLSI layouts are obtained. Furthermore, a comparative study between the hyperstar and seven related networks is conducted. The comparison is based on scalability, broadcasting cost, link requirements, cost/performance ratio, and other static parameters such as degree, diameter, and average diameter.

AB - In this paper, a multiprocessor interconnection topology, the hyperstar, based on the Cartesian product of star graphs is studied. The basic properties of the hyperstar are discussed and proved. This includes reduced degree and diameter, hierarchical structure, vertex symmetry, optimal routing, and shortest path characterization. The hyperstar is shown to be a member of the Cayley class of symmetric graphs. Embeddings of hypercubes, star graphs, and meshes are discussed. An optimal one-to-all broadcasting algorithm is obtained and analyzed. Some results on fault tolerance, parallel paths, Hamiltonian cycles, and VLSI layouts are obtained. Furthermore, a comparative study between the hyperstar and seven related networks is conducted. The comparison is based on scalability, broadcasting cost, link requirements, cost/performance ratio, and other static parameters such as degree, diameter, and average diameter.

KW - Cartesian product networks; embedding; interconnection networks; star graph.

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

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

U2 - 10.1006/jpdc.1997.1414

DO - 10.1006/jpdc.1997.1414

M3 - Article

AN - SCOPUS:0001731568

VL - 48

SP - 175

EP - 199

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 2

ER -