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

Stars
Interpolation
Communication
Parallel algorithms

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.

Parallel Lagrange interpolation on the star graph. / Sarbazi-Azad, H.; Ould-Khaoua, M.; Mackenzie, L. M.; Akl, S. G.

Proceedings of the International Parallel Processing Symposium, IPPS. IEEE, 2000. p. 777-782.

Research output: Chapter in Book/Report/Conference proceedingChapter

Sarbazi-Azad, H, Ould-Khaoua, M, Mackenzie, LM & Akl, SG 2000, Parallel Lagrange interpolation on the star graph. in Proceedings of the International Parallel Processing Symposium, IPPS. IEEE, pp. 777-782.
Sarbazi-Azad H, Ould-Khaoua M, Mackenzie LM, Akl SG. Parallel Lagrange interpolation on the star graph. In Proceedings of the International Parallel Processing Symposium, IPPS. IEEE. 2000. p. 777-782
Sarbazi-Azad, H. ; Ould-Khaoua, M. ; Mackenzie, L. M. ; Akl, S. G. / Parallel Lagrange interpolation on the star graph. Proceedings of the International Parallel Processing Symposium, IPPS. IEEE, 2000. pp. 777-782
@inbook{da9feae4d936466a82287d3351d6339b,
title = "Parallel Lagrange interpolation on the star graph",
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.",
author = "H. Sarbazi-Azad and M. Ould-Khaoua and Mackenzie, {L. M.} and Akl, {S. G.}",
year = "2000",
language = "English",
pages = "777--782",
booktitle = "Proceedings of the International Parallel Processing Symposium, IPPS",
publisher = "IEEE",

}

TY - CHAP

T1 - Parallel Lagrange interpolation on the star graph

AU - Sarbazi-Azad, H.

AU - Ould-Khaoua, M.

AU - Mackenzie, L. M.

AU - Akl, S. G.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033894866&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033894866&partnerID=8YFLogxK

M3 - Chapter

SP - 777

EP - 782

BT - Proceedings of the International Parallel Processing Symposium, IPPS

PB - IEEE

ER -