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
CountryAustria
CitySalzburg
Period2/16/992/18/99

Fingerprint

K-ary N-cubes
Lagrange Interpolation
Parallel algorithms
Parallel Algorithms
Interpolation
Bandwidth
Communication
Initialization
Multiplication
Interprocessor Communication
Multicomputers
Subtraction
Division
Computing

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Sarbazi-Azad, H., Mackenzie, L. M., & Ould-Khaoua, M. (1999). A parallel algorithm for lagrange interpolation on k-ary n-cubes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1557, pp. 85-95). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1557). Springer Verlag. https://doi.org/10.1007/3-540-49164-3_9

A parallel algorithm for lagrange interpolation on k-ary n-cubes. / Sarbazi-Azad, Hamid; Mackenzie, Lewis M.; Ould-Khaoua, Mohamed.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1557 Springer Verlag, 1999. p. 85-95 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1557).

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

Sarbazi-Azad, H, Mackenzie, LM & Ould-Khaoua, M 1999, A parallel algorithm for lagrange interpolation on k-ary n-cubes. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1557, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1557, Springer Verlag, pp. 85-95, 4th International ACPC Conference on Parallel Computation, ACPC 1999, Salzburg, Austria, 2/16/99. https://doi.org/10.1007/3-540-49164-3_9
Sarbazi-Azad H, Mackenzie LM, Ould-Khaoua M. A parallel algorithm for lagrange interpolation on k-ary n-cubes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1557. Springer Verlag. 1999. p. 85-95. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-49164-3_9
Sarbazi-Azad, Hamid ; Mackenzie, Lewis M. ; Ould-Khaoua, Mohamed. / A parallel algorithm for lagrange interpolation on k-ary n-cubes. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1557 Springer Verlag, 1999. pp. 85-95 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{1851419c6fe54151b35402355fce4095,
title = "A parallel algorithm for lagrange interpolation on k-ary n-cubes",
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.",
author = "Hamid Sarbazi-Azad and Mackenzie, {Lewis M.} and Mohamed Ould-Khaoua",
year = "1999",
doi = "10.1007/3-540-49164-3_9",
language = "English",
isbn = "3540656413",
volume = "1557",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "85--95",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

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

AU - Sarbazi-Azad, Hamid

AU - Mackenzie, Lewis M.

AU - Ould-Khaoua, Mohamed

PY - 1999

Y1 - 1999

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

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

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

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

U2 - 10.1007/3-540-49164-3_9

DO - 10.1007/3-540-49164-3_9

M3 - Conference contribution

SN - 3540656413

SN - 9783540656418

VL - 1557

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 85

EP - 95

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -