返回Google圖書搜尋

Finding the Roots of a Polynomial on a MIMD Multicomputer

出版	Ecole Normale Supérieure de Lyon. Laboratoire de l'Informatique du Parallélisme [LIP], 1990
URL	http://books.google.com.hk/books?id=JSwrGwAACAAJ&hl=&source=gbs_api

註釋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 some means to decrease the cost of exchanging data between the processors. Particularly, we show that among the different classical processors networks topologies (ring, 2d-torus or n-cube), the hypercube topology minimizes the communications