A parallel algorithm for lagrange interpolation on k-ary n-cubes

Hamid Sarbazi-Azad, Lewis M. Mackenzie, Mohamed Ould-Khaoua

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

4 Citations (Scopus)

Abstract

Most current multicomputers employ k- ary n-cube networks for lowlatency and high-bandwidth inter-processor communication. This paper introduces a parallel algorithm for computing an N=kn point Lagrange interpolation on these networks. The algorithm consists of three phases: initialisation, main and final. While there is no computation in the initialisation phase, the main phase is composed of kn/2 steps, each consisting of four multiplications and four subtractions, and an additional step including one division and one multiplication. The final phase is carried out in n×⌈k/2⌉ steps, each using one addition.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages85-95
Number of pages11
Volume1557
ISBN (Print)3540656413, 9783540656418
DOIs
Publication statusPublished - 1999
Event4th International ACPC Conference on Parallel Computation, ACPC 1999 - Salzburg, Austria
Duration: Feb 16 1999Feb 18 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1557
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International ACPC Conference on Parallel Computation, ACPC 1999
Country/TerritoryAustria
CitySalzburg
Period2/16/992/18/99

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Fingerprint

Dive into the research topics of 'A parallel algorithm for lagrange interpolation on k-ary n-cubes'. Together they form a unique fingerprint.

Cite this