Matrix decomposition on the star graph

Abdel Elah Al-Ayyoub*, Khaled Day

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

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

14 اقتباسات (Scopus)


We present and evaluate, for the first time, a parallel algorithm for solving the LU decomposition problem on the star graph. The proposed parallel algorithm is of O(N 3/n!) computation complexity and uses O(Nn) communication time to decompose a matrix of order N on a star graph of dimension n, where N≥(n - 1)!. The incurred communication time is better than the best known results for the hypercube, O(N log n!), and the mesh, O(N√n!), each with approximately n! nodes. The proposed parallel algorithm takes advantage of the attractive topological qualities of the star graph in order to reduce the communication time involved in tasks such as pivoting, row/column interchanges, and pivot row and multipliers column broadcasts.

اللغة الأصليةEnglish
الصفحات (من إلى)803-812
عدد الصفحات10
دوريةIEEE Transactions on Parallel and Distributed Systems
مستوى الصوت8
رقم الإصدار8
المعرِّفات الرقمية للأشياء
حالة النشرPublished - 1997

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1711???
  • ???subjectarea.asjc.1700.1708???
  • ???subjectarea.asjc.1700.1703???


أدرس بدقة موضوعات البحث “Matrix decomposition on the star graph'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا