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

Abdel Elah Al-Ayyoub*, Khaled Day

*المؤلف المقابل لهذا العمل

نتاج البحث: المساهمة في مجلةArticleمراجعة النظراء

4 اقتباسات (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.

اللغة الأصليةEnglish
الصفحات (من إلى)85-99
عدد الصفحات15
دوريةInternational Journal of High Speed Computing
مستوى الصوت9
رقم الإصدار2
المعرِّفات الرقمية للأشياء
حالة النشرPublished - يونيو 1997

ASJC Scopus subject areas

  • ???subjectarea.asjc.2600.2614???
  • ???subjectarea.asjc.1700.1703???


أدرس بدقة موضوعات البحث “Parallel solution of systems on the k-ary n-cube networks'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا