### 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=k^{n} 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 k^{n}/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 language | English |
---|---|

Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Publisher | Springer Verlag |

Pages | 85-95 |

Number of pages | 11 |

Volume | 1557 |

ISBN (Print) | 3540656413, 9783540656418 |

DOIs | |

Publication status | Published - 1999 |

Event | 4th International ACPC Conference on Parallel Computation, ACPC 1999 - Salzburg, Austria Duration: Feb 16 1999 → Feb 18 1999 |

### Publication series

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

Volume | 1557 |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 4th International ACPC Conference on Parallel Computation, ACPC 1999 |
---|---|

Country | Austria |

City | Salzburg |

Period | 2/16/99 → 2/18/99 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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

}

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 -