A parallel algorithm for Lagrange interpolation on the cube-connected cycles

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


This paper introduces a parallel algorithm for computing an N = n2n point Lagrange interpolation on an n-dimensional cube-connected cycles (CCCn). 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 n2n-1 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 two sub-phases. There are [n/2] steps in the first sub-phase, each including two additions and one communication, followed by the second sub-phase which comprises n steps each consisting of one addition and two communication operations.

Original languageEnglish
Pages (from-to)135-140
Number of pages6
JournalMicroprocessors and Microsystems
Issue number3
Publication statusPublished - Jun 1 2000
Externally publishedYes


  • Cube-connected cycles
  • Interconnection networks
  • Lagrange interpolation
  • Parallel algorithms

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence


Dive into the research topics of 'A parallel algorithm for Lagrange interpolation on the cube-connected cycles'. Together they form a unique fingerprint.

Cite this