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.
N1 - Funding Information:
Hamid Sarbazi-Azad was born in 1968, Ray, Tehran, Iran. He received his BSc degree in Electrical and Computer Engineering from the Shahid-Beheshti University, Tehran, in 1992, and the MSc degree in Computer Engineering from the Sharif University of Technology, Tehran, Iran, in 1994. From graduation until 1997, he worked as a research faculty member at the National Organisation for the Evaluation of Education, Tehran. He is currently pursuing his PhD study in the Department of Computing Science at the University of Glasgow, Glasgow, UK, through a scholarship from the Ministry of Culture and Higher Education of the Islamic Republic of Iran. His research interests include parallel computing, interconnection networks, and their performance evaluation.
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
U2 - 10.1016/S0141-9331(00)00066-1
DO - 10.1016/S0141-9331(00)00066-1
M3 - Article
AN - SCOPUS:0346054722
SN - 0141-9331
VL - 24
SP - 135
EP - 140
JO - Microprocessors and Microsystems
JF - Microprocessors and Microsystems
IS - 3
ER -