Matrix decomposition on the star graph

Abdel Elah Al-Ayyoub*, Khaled Day

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

14 Citations (SciVal)


We present and evaluate, for the first time, a parallel algorithm for solving the LU decomposition problem on the star graph. The proposed parallel algorithm is of O(N 3/n!) computation complexity and uses O(Nn) communication time to decompose a matrix of order N on a star graph of dimension n, where N≥(n - 1)!. The incurred communication time is better than the best known results for the hypercube, O(N log n!), and the mesh, O(N√n!), each with approximately n! nodes. The proposed parallel algorithm takes advantage of the attractive topological qualities of the star graph in order to reduce the communication time involved in tasks such as pivoting, row/column interchanges, and pivot row and multipliers column broadcasts.

Original languageEnglish
Pages (from-to)803-812
Number of pages10
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number8
Publication statusPublished - 1997


  • Interconnection networks
  • Matrix decomposition
  • Parallel processing
  • Star graphs

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'Matrix decomposition on the star graph'. Together they form a unique fingerprint.

Cite this