TY - JOUR
T1 - Parallel solution of systems on the k-ary n-cube networks
AU - Al-Ayyoub, Abdel Elah
AU - Day, Khaled
PY - 1997/6
Y1 - 1997/6
N2 - 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.
AB - 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.
KW - Interconnection topologies
KW - Linear systems
KW - Parallel computing
KW - k-ary n-cube
UR - http://www.scopus.com/inward/record.url?scp=0006192445&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0006192445&partnerID=8YFLogxK
U2 - 10.1142/s0129053397000088
DO - 10.1142/s0129053397000088
M3 - Article
AN - SCOPUS:0006192445
SN - 0129-0533
VL - 9
SP - 85
EP - 99
JO - International Journal of High Speed Computing
JF - International Journal of High Speed Computing
IS - 2
ER -