Academic Journal
Parallel Solution Of Dense Linear Systems On The k-Ary n-Cube Networks
| العنوان: | Parallel Solution Of Dense Linear Systems On The k-Ary n-Cube Networks |
|---|---|
| المؤلفون: | Abdel-elah Al-ayyoub, Khaled Day |
| المساهمون: | The Pennsylvania State University CiteSeerX Archives |
| المصدر: | http://www.squ.edu.om/sci/cs/faculty/kday/IJHSC-97.ps. |
| سنة النشر: | 1997 |
| المجموعة: | CiteSeerX |
| مصطلحات موضوعية: | Interconnection topologies, k-ary n-cube, linear systems, parallel |
| الوصف: | 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) communication time to factorize a matrix of order N on the k-ary 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. |
| نوع الوثيقة: | text |
| وصف الملف: | application/postscript |
| اللغة: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.2307; http://www.squ.edu.om/sci/cs/faculty/kday/IJHSC-97.ps |
| الاتاحة: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.2307 http://www.squ.edu.om/sci/cs/faculty/kday/IJHSC-97.ps |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| رقم الانضمام: | edsbas.57992F9E |
| قاعدة البيانات: | BASE |
| الوصف غير متاح. |