Node-ranking schemes for the star networks

Abdel Elah Al-Ayyoub*, Khaled Day

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


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
Issue number3
Publication statusPublished - Mar 1 2003


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

ASJC Scopus subject areas

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


Dive into the research topics of 'Node-ranking schemes for the star networks'. Together they form a unique fingerprint.

Cite this