Node-ranking schemes for the star networks

Abdel Elah Al-Ayyoub, Khaled Day

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper, three new node-ranking schemes for the star graph are presented and evaluated. These node-ranking schemes efficiently "embed" grids, pipelines, and reconfigurable multiple ring networks (cases of torus networks). These schemes improve similar known results on the star graph. They also allow efficient mapping of a wide class of algorithms into the star graph and hence facilitating further testing for the viability of the star graph as a potential interconnection network for large-scale multiprocessor systems. The proposed node-ranking schemes outperform their hypercube counterparts in terms of communication cost. Finally, two algorithms for solving systems of linear equations are given. These algorithms are based on the proposed grid and pipeline schemes to carry out matrix triangulation and backward substitution, respectively.

Original languageEnglish
Pages (from-to)239-250
Number of pages12
JournalJournal of Parallel and Distributed Computing
Volume63
Issue number3
DOIs
Publication statusPublished - Mar 1 2003

Fingerprint

Star Graph
Stars
Star
Ranking
Vertex of a graph
Pipelines
Grid
Triangulation
Ring Network
Linear equations
Communication Cost
Interconnection Networks
Multiprocessor Systems
Large-scale Systems
System of Linear Equations
Hypercube
Substitution reactions
Viability
Substitution
Torus

Keywords

  • Interconnection networks
  • Node ranking
  • Parallel processing
  • Star graphs

ASJC Scopus subject areas

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

Cite this

Node-ranking schemes for the star networks. / Al-Ayyoub, Abdel Elah; Day, Khaled.

In: Journal of Parallel and Distributed Computing, Vol. 63, No. 3, 01.03.2003, p. 239-250.

Research output: Contribution to journalArticle

Al-Ayyoub, Abdel Elah ; Day, Khaled. / Node-ranking schemes for the star networks. In: Journal of Parallel and Distributed Computing. 2003 ; Vol. 63, No. 3. pp. 239-250.
@article{f768c0982a4845bea3d69d625cea3bcb,
title = "Node-ranking schemes for the star networks",
abstract = "In this paper, three new node-ranking schemes for the star graph are presented and evaluated. These node-ranking schemes efficiently {"}embed{"} grids, pipelines, and reconfigurable multiple ring networks (cases of torus networks). These schemes improve similar known results on the star graph. They also allow efficient mapping of a wide class of algorithms into the star graph and hence facilitating further testing for the viability of the star graph as a potential interconnection network for large-scale multiprocessor systems. The proposed node-ranking schemes outperform their hypercube counterparts in terms of communication cost. Finally, two algorithms for solving systems of linear equations are given. These algorithms are based on the proposed grid and pipeline schemes to carry out matrix triangulation and backward substitution, respectively.",
keywords = "Interconnection networks, Node ranking, Parallel processing, Star graphs",
author = "Al-Ayyoub, {Abdel Elah} and Khaled Day",
year = "2003",
month = "3",
day = "1",
doi = "10.1016/S0743-7315(02)00056-4",
language = "English",
volume = "63",
pages = "239--250",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - Node-ranking schemes for the star networks

AU - Al-Ayyoub, Abdel Elah

AU - Day, Khaled

PY - 2003/3/1

Y1 - 2003/3/1

N2 - In this paper, three new node-ranking schemes for the star graph are presented and evaluated. These node-ranking schemes efficiently "embed" grids, pipelines, and reconfigurable multiple ring networks (cases of torus networks). These schemes improve similar known results on the star graph. They also allow efficient mapping of a wide class of algorithms into the star graph and hence facilitating further testing for the viability of the star graph as a potential interconnection network for large-scale multiprocessor systems. The proposed node-ranking schemes outperform their hypercube counterparts in terms of communication cost. Finally, two algorithms for solving systems of linear equations are given. These algorithms are based on the proposed grid and pipeline schemes to carry out matrix triangulation and backward substitution, respectively.

AB - In this paper, three new node-ranking schemes for the star graph are presented and evaluated. These node-ranking schemes efficiently "embed" grids, pipelines, and reconfigurable multiple ring networks (cases of torus networks). These schemes improve similar known results on the star graph. They also allow efficient mapping of a wide class of algorithms into the star graph and hence facilitating further testing for the viability of the star graph as a potential interconnection network for large-scale multiprocessor systems. The proposed node-ranking schemes outperform their hypercube counterparts in terms of communication cost. Finally, two algorithms for solving systems of linear equations are given. These algorithms are based on the proposed grid and pipeline schemes to carry out matrix triangulation and backward substitution, respectively.

KW - Interconnection networks

KW - Node ranking

KW - Parallel processing

KW - Star graphs

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

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

U2 - 10.1016/S0743-7315(02)00056-4

DO - 10.1016/S0743-7315(02)00056-4

M3 - Article

VL - 63

SP - 239

EP - 250

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 3

ER -