Abstract
Most current multicomputers employ k- ary n-cube networks for lowlatency and high-bandwidth inter-processor communication. This paper introduces a parallel algorithm for computing an N=k n point Lagrange interpolation on these networks. 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 ⌈k n/2⌉ steps, each consisting of four multiplications and four subtractions, and an additional step including one division and one multiplication. The final phase is carried out in n×⌈k/2⌉ steps, each using one addition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ashir, Y., Stewart, I.A.: On embedding cycles in k-ary n-cubes. Parall. Process. Lett. 7 (1997) 49–55.
Ashir, Y., Stewart, I.A.: Fault tolerant embedding of Hamiltonian circuits in k-ary ncubes. Technical report, Dept of Math. Computer Sci., Univ. of Leicester, Leicester, U.K (1997).
Bertsekas, D., Tsitsiklis, J.: Parallel and Distributed computation: Numerical methods. Prentice-Hall (1989).
Bettayeb, S.: On the k-ary hypercube. Theoret. Comp. Sci. 140 (1995) 333–339.
Borkar, S., et al.: iWarp: an integrated solution to high speed parallel computing. Proc. Supercomputing’88, IEEE Computer Society Press (1988) 330–339.
Bose, B., Broeg, B., Kwon, Y., Ashir, Y.: Lee distance and topological properties of k-ary n-cubes. IEEE Trans. Computers 44 (1995) 1021–1030.
Capello, B., Gallopoulos, Koc: Systolic computation of interpolation polynomials. Parallel Computing Journal 45 (1990) 95–117.
Dally, W.J., et al.: The J-machine: a fine-grain concurrent computer. Information Processing’89, Elsevier Science Publisher (1989) 114–1153.
Dally, W.J.: Performance analysis of k-ary n-cube interconnection networks. IEEE Trans. Computers 39 (1990) 775–785.
Day, K., Al-Ayyoub, A.: Fault diameter of k-ary n-cube networks. IEEE Trans. Parallel & Distributed Systems 8 (1997) 903–907.
Goertzel, B.: Lagrange interpolation on a tree of processors with ring connections. Journal Parallel & Distributed Computing 22 (1994) 321–323.
Nugent, S.F.: The iPSC/2 direct-connect communication technology. Proc. Conf. Hypercube Concurrent Computers & Applications Vol. 1 (1988) 51–60.
Oed, W.: The Cray research massively parallel processing system: Cray T3D. Cray Research Inc. Technical Report (1993).
Sarbazi-Azad, H., Mackenzie, L.M., Ould-khaoua, M.: A parallel algorithmarchitecture for Lagrange interpolation. Proc. Parallel & Distributed Processing: Techniques & Applications (PDPTA’98) Las Vegas (1998) 1455–1458.
Sarbazi-Azad, H., Mackenzie, L.M., Ould-khaoua, M.: A novel method for Hamiltonian ring embedding in k-ary n-cube networks. Tech. Report, Dept of Computing Sci., Glasgow University (1998).
Seitz, C.L.: The Cosmic Cube. CACM 28 (1985) 22–33.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sarbazi-Azad, H., Mackenzie, L.M., Ould-Khaoua, M. (1999). A Parallel Algorithm for Lagrange Interpolation on k-ary n-Cubes. In: Zinterhof, P., Vajteršic, M., Uhl, A. (eds) Parallel Computation. ACPC 1999. Lecture Notes in Computer Science, vol 1557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49164-3_9
Download citation
DOI: https://doi.org/10.1007/3-540-49164-3_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65641-8
Online ISBN: 978-3-540-49164-4
eBook Packages: Springer Book Archive