Iterative Algorithms on Heterogeneous Network Computing: Parallel Polynomial Root Extracting

Authors:
Raphaël Couturier;Philippe Canalda;François Spies
Affiliations:
-;-;-
Venue:
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Year:
2002

Citing 3
Cited 2

Aberth's method for the parallel iterative finding of polynomial zeros

APL '94 Proceedings of the international conference on APL : the language and its applications: the language and its applications
Using MPI: portable parallel programming with the message-passing interface

Using MPI: portable parallel programming with the message-passing interface
Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer

IEEE Transactions on Parallel and Distributed Systems

Parallel Polynomial Root Extraction on A Ring of Processors

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16
The performance of synchronous parallel polynomial root extraction on a ring multicomputer

Cluster Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article describes various algorithms on heterogeneous architecture applied to parallel polynomial root extracting. The use of a set of clusters in order to compute great parallel applications is an ongoing challenge. Asynchronous algorithms are well suited for this type of architecture, because no synchronous barriers are needed. The scalability of such architecture is a hard task to achieve. In this paper, we compare local calculus and calculus on the Internet in order to focus on the efficiency of such methods.