Skip to main content
SpringerLink
Log in

A performance analysis of network topologies in finding the roots of a polynomial

  • Algorithmic Studies For Hypercube-Type Systems
  • Conference paper
  • First Online:
CONPAR 90 — VAPP IV (VAPP 1990, CONPAR 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 457))

  • 121 Accesses

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)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O. Aberth: "Iteration Methods for Finding all Zeros of a Polynomial Simultaneously" Mathematics of computation, v27, no122, 339–344 (1973).

    Google Scholar 

  2. 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).

    Google Scholar 

  3. 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).

    Google Scholar 

  4. T.Champion and B.Tourancheau: "Tnode: document utilisateur" Technical Report LIP-IMAG 89-02, ENS Lyon, France (1989).

    Google Scholar 

  5. M.Cosnard and P.Fraigniaud: "Asynchronous Durand-Kerner and Aberth polynomial root finding methods on a distributed memory multicomputer" Parallel Computing 89, Leiden (1989).

    Google Scholar 

  6. 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).

    Google Scholar 

  7. P.Fraigniaud: "The Durand-Kerner polynomials root finding method in case of multiple roots" To appear in BIT.

    Google Scholar 

  8. P.Fraigniaud: "Performance analysis of broadcasting in hypercubes" Hypercube and distributed computers 311–328, F.André and J.P.Verjus Editors, North-Holland (1989).

    Google Scholar 

  9. P. Fraigniaud, S. Miguet and Y. Robert: "Scattering on a ring of processors" Parallel Computing v13, no3, 377–383 (1990).

    MathSciNet  Google Scholar 

  10. T.L. Freeman: "Calculating polynomial zeros on a local memory parallel computer" Parallel Computing v12, 351–358 (1989).

    Google Scholar 

  11. H. Guggenheimer: "Initial approximations in Durand-Kerner's root finding method" BIT 26, 537–539 (1986).

    Google Scholar 

  12. L.H. Jamieson and T.A. Rice: "A highly parallel algorithm for root extraction" IEEE Trans. on Comp. v28, no3, 443–449 (1989).

    Google Scholar 

  13. C.T. Ho and S.L. Johnsson: "Optimum broadcasting and personalized communication in hypercubes" IEEE Trans. Comp. vol 38, no9 (1989).

    Google Scholar 

  14. I.O. Kerner: "Ein gesamtschrittverfahren zur berechnung der nullstellen von polynomen" Numerische Mathematik 8, 290–294 (1966).

    Google Scholar 

  15. S.Kuppuswami and B.Tourancheau: "Evaluating the performances of Transputer based hypercube vector computer" La lettre du Transputer, no4 (1990).

    Google Scholar 

  16. 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).

    Google Scholar 

  17. Y. Saad and M.H. Schultz: "Data communication in parallel architectures" Parallel Computing 11, 131–150 (1989).

    MathSciNet  Google Scholar 

  18. Q.F.Stout and B.Wager: "Intensive hypercube communication I" University of Michigan, Computing research laboratory CRL-TR-9-87 (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de l'Informatique du Parallélisme - IMAG ENS Lyon, 46 Allée d'Italie, 69364, Lyon Cedex 07, France

    Michel Cosnard & Pierre Fraigniaud

Authors
  1. Michel Cosnard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Fraigniaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Helmar Burkhart

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation