K. Day and A. E. Al-Ayyoub, “Fault Diameter of k-Ary n-Cube Networks,” IEEE Transactions on Parallel and Distributed Systems, Vol. 8, No. 9, 1997, pp. 903-907. doi:10.1109/71.615436

has been cited by the following article:

• TITLE: Parallel Implementation of the Gauss-Seidel Algorithm on k-Ary n-Cube Machine

  AUTHORS: Mohammad H. Al-Towaiq

  KEYWORDS: Cluster Computing; Parallel Computing; Linear Systems of Equations; Direct Methods; Iterative Methods

  JOURNAL NAME: Applied Mathematics, Vol.4 No.1A, January 30, 2013

  ABSTRACT: In this paper, we present parallel implementation of the Gauss-Seidel (GS) iterative algorithm for the solution of linear systems of equations on a k-ary n-cube parallel machine using Open MPI as a parallel programming environment. The proposed algorithm is of O(N3/kn) computational complexity and uses O(nN) communication time to decompose a matrix of order N on the a k-ary n-cube provided N ≥ kn-1. The incurred communication time is better than the best known results for hypercube, O(N log n!), and the mesh, O(N n!), each with approximately n! nodes. The numerical results show that speedup improves as number of processors increased and the proposed algorithm has approximately 80% parallel efficiency.