## Abstract

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(N^{3}/k^{n}) 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 k^{n}), and the mesh, O(N√k^{n}), each with approximately k^{n} 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 language | English |
---|---|

Pages (from-to) | 85-99 |

Number of pages | 15 |

Journal | International Journal of High Speed Computing |

Volume | 9 |

Issue number | 2 |

Publication status | Published - Jun 1997 |

## Keywords

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

## ASJC Scopus subject areas

- Computational Theory and Mathematics
- Theoretical Computer Science