Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

An efficient parallel algorithm for Lagrange interpolation and its performance

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Sarbazi-Azad, H. ; Dept. of Comput. Sci., Glasgow Univ., UK ; Mackenzie, L.M. ; Ould-Khaoua, M. ; Min, G.

This paper introduces a parallel algorithm for computing an N=n2/sup n/ point Lagrange interpolation on n-dimensional cube-connected cycles (CCC/sub n/). The algorithm exploits several communication techniques in a novel way which can be adapted for computing similar functions. The performance of the algorithm is also evaluated by means of a speedup measure. It shows a near to optimal speedup for a state-of-the-art implementation technology.

Published in:

High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on  (Volume:2 )

Date of Conference:

14-17 May 2000