Abstract
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 language | English |
---|---|
Pages (from-to) | 135-140 |
Number of pages | 6 |
Journal | Microprocessors and Microsystems |
Volume | 24 |
Issue number | 3 |
Publication status | Published - Jun 1 2000 |
Keywords
- Cube-connected cycles
- Interconnection networks
- Lagrange interpolation
- Parallel algorithms
ASJC Scopus subject areas
- Computer Networks and Communications
- Hardware and Architecture
- Software
- Control and Systems Engineering
- Electrical and Electronic Engineering