Asynchronism for Iterative Algorithms in a Global Computing Environment

Authors:
Jacques M. Bahi;Sylvain Contassot-Vivier;Raphaël Couturier
Affiliations:
-;-;-
Venue:
HPCS '02 Proceedings of the 16th Annual International Symposium on High Performance Computing Systems and Applications
Year:
2002

Citing 0
Cited 8

A Decentralized Convergence Detection Algorithm for Asynchronous Parallel Iterative Algorithms

IEEE Transactions on Parallel and Distributed Systems
Dynamic Load Balancing and Efficient Load Estimators for Asynchronous Iterative Algorithms

IEEE Transactions on Parallel and Distributed Systems
Solving Three-Dimensional Transport Models with Synchronous and Asynchronous Iterative Algorithms in a Grid Computing Environment

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14
Parallelization of Direct Algorithms using Multisplitting Methods in Grid Environments

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14
Performance Comparison of Parallel Programming Environments for Implementing AIAC Algorithms

The Journal of Supercomputing
A comparative study of two Java high performance environments for implementing parallel iterative methods

APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Fast iterative solution of large sparse linear systems on geographically separated clusters

International Journal of High Performance Computing Applications
Asynchronous iterative algorithms for computational science on the grid: three case studies

VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The subject of this paper is to show the very high power of asynchronism for iterative algorithms in the context of global computing,that is to say, with machines scattered all around the world. The question is whether or not asynchronism helps to reduce the communication penalty and the overall computation time of a given parallel algorithm. The asynchronous programming model is applied to a given problem implemented with a multi-threadedenvironment and tested over two kinds of clusters of workstations; a homogeneous local cluster and a heterogeneous non-local one. The main features of this programming model are exhibited and the high efficiency and interest of such algorithms is pointed out.