An efficient parallel algorithm for Lagrange interpolation and its performance

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

This paper introduces a parallel algorithm for computing an N=n2n point Lagrange interpolation on n-dimensional cube-connected cycles (CCCn). The algorithm exploits several communication techniques in a novel way which can be adapted for computing similar functions. The performance of the algorithm is also evaluated by means of a speedup measure. It shows a near to optimal speedup for a state-of-the-art implementation technology.

Original languageEnglish
Title of host publicationProceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages593-598
Number of pages6
Volume2
ISBN (Print)0769505902, 9780769505909
DOIs
Publication statusPublished - 2000
Event4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000 - Beijing, China
Duration: May 14 2000May 17 2000

Other

Other4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000
CountryChina
CityBeijing
Period5/14/005/17/00

    Fingerprint

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Sarbazi-Azad, H., Mackenzie, L. M., Ould-Khaoua, M., & Min, G. (2000). An efficient parallel algorithm for Lagrange interpolation and its performance. In Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000 (Vol. 2, pp. 593-598). [843503] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/HPC.2000.843503