Parallel Lagrange interpolation on the star graph

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

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)

Abstract

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
PublisherIEEE
Pages777-782
Number of pages6
Publication statusPublished - 2000

    Fingerprint

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Sarbazi-Azad, H., Ould-Khaoua, M., Mackenzie, L. M., & Akl, S. G. (2000). Parallel Lagrange interpolation on the star graph. In Proceedings of the International Parallel Processing Symposium, IPPS (pp. 777-782). IEEE.