Parallel Lagrange interpolation on the star graph

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)


This paper introduces a parallel algorithm for computing an N = n!-point Lagrange interpolation on an n-star (n>2). It exploits several communication techniques on stars in a novel way which can be adapted for computing similar functions. The algorithm 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) sub-phases each with O(log n) steps where each step takes three communications and one addition.

Original languageEnglish
Title of host publicationProceedings of the International Parallel Processing Symposium, IPPS
Number of pages6
Publication statusPublished - 2000

ASJC Scopus subject areas

  • Hardware and Architecture


Dive into the research topics of 'Parallel Lagrange interpolation on the star graph'. Together they form a unique fingerprint.

Cite this