Abstract
This paper introduces the parallelization on a distributed memory multicomputer of two iterative methods for finding all the roots of a given polynomial. The parallel algorithms share the computation of the roots among the processors and perform a total exchange of the data at each step. Since the amount of communications is the main drawback of this approach, we study the effect of the network topology on the performance of the algorithms. Particularly, we show that among the different classical processors networks topologies (ring, 2d-torus or n-cube), the hypercube topology minimizes the communications. For each topology is computed the optimal number of processors. Experiments on the hypercube FPS T40 illustrate the results.
This work is, in part, supported by the Research Program C3 of the CNRS and MEN, and by the Direction des Recherches et Etudes Techniques (DGA)
Chapter PDF
Similar content being viewed by others
Key words
References
O. Aberth: "Iteration Methods for Finding all Zeros of a Polynomial Simultaneously" Mathematics of computation, v27, no122, 339–344 (1973).
J.C. Bermond and C. Peyrat: "de Bruijn and Kautz networks: a competitor for the hypercube ?" Hypercube and distributed computers 279–293, F.André and J.P. Verjus Editors, North-Holland (1989).
L.Bomans and D.Roose: "Communication benchmarks for the iPSC/2" Hypercube and distributed computers 93–104, F.André and J.P.Verjus Editors, North-Holland (1989).
T.Champion and B.Tourancheau: "Tnode: document utilisateur" Technical Report LIP-IMAG 89-02, ENS Lyon, France (1989).
M.Cosnard and P.Fraigniaud: "Asynchronous Durand-Kerner and Aberth polynomial root finding methods on a distributed memory multicomputer" Parallel Computing 89, Leiden (1989).
E. Durand: "Solutions numériques des équations algébriques, Tome 1: Equations du type F(x)=0; Racines d'un polynôme" Masson, Paris, (1960).
P.Fraigniaud: "The Durand-Kerner polynomials root finding method in case of multiple roots" To appear in BIT.
P.Fraigniaud: "Performance analysis of broadcasting in hypercubes" Hypercube and distributed computers 311–328, F.André and J.P.Verjus Editors, North-Holland (1989).
P. Fraigniaud, S. Miguet and Y. Robert: "Scattering on a ring of processors" Parallel Computing v13, no3, 377–383 (1990).
T.L. Freeman: "Calculating polynomial zeros on a local memory parallel computer" Parallel Computing v12, 351–358 (1989).
H. Guggenheimer: "Initial approximations in Durand-Kerner's root finding method" BIT 26, 537–539 (1986).
L.H. Jamieson and T.A. Rice: "A highly parallel algorithm for root extraction" IEEE Trans. on Comp. v28, no3, 443–449 (1989).
C.T. Ho and S.L. Johnsson: "Optimum broadcasting and personalized communication in hypercubes" IEEE Trans. Comp. vol 38, no9 (1989).
I.O. Kerner: "Ein gesamtschrittverfahren zur berechnung der nullstellen von polynomen" Numerische Mathematik 8, 290–294 (1966).
S.Kuppuswami and B.Tourancheau: "Evaluating the performances of Transputer based hypercube vector computer" La lettre du Transputer, no4 (1990).
J.L. Nicolas and A. Schinzel: "Localisation des zeros de polynômes intervenant en théorie du signal" Research report Dep. of Math. univ. of Limoges, Limoges, France (1989).
Y. Saad and M.H. Schultz: "Data communication in parallel architectures" Parallel Computing 11, 131–150 (1989).
Q.F.Stout and B.Wager: "Intensive hypercube communication I" University of Michigan, Computing research laboratory CRL-TR-9-87 (1987).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cosnard, M., Fraigniaud, P. (1990). A performance analysis of network topologies in finding the roots of a polynomial. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_162
Download citation
DOI: https://doi.org/10.1007/3-540-53065-7_162
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53065-7
Online ISBN: 978-3-540-46597-3
eBook Packages: Springer Book Archive