A parallel algorithm for Lagrange interpolation on the star graph

H. Sarbazi-Azad*, M. Ould-Khaoua, L. M. Mackenzie, S. G. Akl

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

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

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


This paper introduces a new parallel algorithm for computing an N(= n!)-point Lagrange interpolation on an n-star (n > 2). The proposed algorithm exploits several communication techniques on stars in a novel way, which can be adapted for computing similar functions. It is optimal and consists of three phases: initialization, main, and final. While there is no computation in the initialization phase, the main phase is composed of n!/2 steps, each consisting of four multiplications, four subtractions, and one communication operation and an additional step including one division and one multiplication. The final phase is carried out in (n-1) subphases each with O(log n) steps where each step takes three communications and one addition. Results from a cost-performance comparative analysis reveal that for practical network sizes the new algorithm on the star exhibits superior performance over those proposed for common interconnection networks.

اللغة الأصليةEnglish
الصفحات (من إلى)605-621
عدد الصفحات17
دوريةJournal of Parallel and Distributed Computing
مستوى الصوت62
رقم الإصدار4
المعرِّفات الرقمية للأشياء
حالة النشرPublished - 2002
منشور خارجيًانعم

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1712???
  • ???subjectarea.asjc.2600.2614???
  • ???subjectarea.asjc.1700.1708???
  • ???subjectarea.asjc.1700.1705???
  • ???subjectarea.asjc.1700.1702???


أدرس بدقة موضوعات البحث “A parallel algorithm for Lagrange interpolation on the star graph'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا