An efficient parallel algorithm for Lagrange interpolation and its performance

Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000

Volumn 2, Issue , 2000, Pages 593-598

  Sarbazi Azad, H ^a   Mackenzie, L M ^a   Ould Khaoua, M ^b   Min, G ^b  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

^b UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

INTERPOLATION; LAGRANGE MULTIPLIERS; PARALLEL ALGORITHMS;

COMMUNICATION TECHNIQUES; LAGRANGE INTERPOLATIONS; N-DIMENSIONAL CUBES; STATE OF THE ART;

ALGORITHMS;

EID: 33745825478     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPC.2000.843503     Document Type: Conference Paper

References (16)

1. F. Annexstein et al.,"Group action graphs and parallel architectures", SIAM Journal of Computing, 19, pp.544-569, 1990.
2. A. Bertsekas and Tsitsiklis, Parallel and distributed computation: numerical methods, Prentice-Hall, 1989.
3. G. Calrson et al., "Interconnection networks based on generalizations of cube-connected cycles", IEEE TC, C-34, pp. 769-772, 1985.
4. B. Capello et al., "Systolic computation of interpolation polynomials", Parallel Computing, 45, pp.95-117, 1990.
5. th Int. Conf. High Performance Computing (HiPC'97), IEEE Computer Society Press, 1997.
6. W.J. Dally and C.L. Seitz, "Deadlock-free message routing in multiprocessor interconnection networks", IEEE TC, C-36, pp. 547-553, 1987.
7. R. Feldmann and W. Unger,"The cube-connected cycles is a subgraph of the Butterfly network", Parallel Processing Letters, 2, pp.13-19, 1992.
8. J. Hromovic et al., "Dissemination of Information in interconnection networks (Broadcasting and Gossiping)", in Combinational Network Theory, Editors: F. Hsu, D. Du, Kluwer Academic Publishers, pp. 125-212, 1995.
9. R. Klasing, "Improved compression of cube-connected cycles networks", IEEE TPDS, 9, pp.803-812, 1998.
10. F.T. Leighton, Introduction to parallel algorithms and architectures: arrays, trees, hypercubes, Morgan Kaufmann, 1992.
11. A. McKeown, "Iterated interpolation using a systolic array", ACM Trans. Math. Software, 12, pp. 162-170, 1986.
12. D. Meliksetian and C. Chen, "Optimal routing algorithm and the diameter of the cube-connected cycles", IEEE TPDS, 4, pp. 1172-1178, 1993.
13. D. Meliksetian and C. Chen, "Communication aspects of the cube-connected cycles", Proc. Int'l Conf. Parallel Processing, pp. 1-579-580, 1990.
14. S. Oberman, Design issues in high performance floating point arithmetic units, PhD thesis, Stanford Univ., Nov. 1996.
15. F.P. Preparata and J. Vuillemin, "The cube-connected cycles: A versatile network for parallel computation", CACM, 24, pp.300-309, 1981.
16. B. Wendroff, Theoretical Numerical Analysis, Academic Press Inc., 1966.