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 |
Fingerprint
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
Cite this
A parallel algorithm for Lagrange interpolation on the cube-connected cycles. / Sarbazi-Azad, Hamid; Ould-Khaoua, Mohamed; Mackenzie, Lewis M.
In: Microprocessors and Microsystems, Vol. 24, No. 3, 01.06.2000, p. 135-140.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A parallel algorithm for Lagrange interpolation on the cube-connected cycles
AU - Sarbazi-Azad, Hamid
AU - Ould-Khaoua, Mohamed
AU - Mackenzie, Lewis M.
PY - 2000/6/1
Y1 - 2000/6/1
N2 - 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.
AB - 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.
KW - Cube-connected cycles
KW - Interconnection networks
KW - Lagrange interpolation
KW - Parallel algorithms
UR - http://www.scopus.com/inward/record.url?scp=0346054722&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0346054722&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0346054722
VL - 24
SP - 135
EP - 140
JO - Microprocessors and Microsystems
JF - Microprocessors and Microsystems
SN - 0141-9331
IS - 3
ER -