Parallel solution of systems on the k-ary n-cube networks

Abdel Elah Al-Ayyoub*, Khaled Day

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


In this paper a parallel algorithm for solving systems of linear equation on the k-ary n-cube is presented and evaluated for the first time. The proposed algorithm is of O(N3/kn) computation complexity and uses O(Nn) commun ication time to factorize a matrix of order N on the k-airy n-cube. This is better than the best known results for the hypercube, O(N log kn), and the mesh, O(N√kn), each with approximately kn nodes. The proposed parallel algorithm takes advantage of the extra connectivity in the k-ary n-cube 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)85-99
Number of pages15
JournalInternational Journal of High Speed Computing
Issue number2
Publication statusPublished - Jun 1997


  • Interconnection topologies
  • Linear systems
  • Parallel computing
  • k-ary n-cube

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'Parallel solution of systems on the k-ary n-cube networks'. Together they form a unique fingerprint.

Cite this