Coupling Dynamic Load Balancing with Asynchronism in Iterative Algorithms on the Computational Grid

Authors:
Jacques M. Bahi;Sylvain Contassot-Vivier;Raphaël Couturier
Affiliations:
-;-;-
Venue:
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Year:
2003

Citing 0
Cited 8

A Decentralized Convergence Detection Algorithm for Asynchronous Parallel Iterative Algorithms

IEEE Transactions on Parallel and Distributed Systems
Evaluation of the asynchronous iterative algorithms in the context of distant heterogeneous clusters

Parallel Computing
Performance Comparison of Parallel Programming Environments for Implementing AIAC Algorithms

The Journal of Supercomputing
Wrekavoc: a tool for emulating heterogeneity

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Workload balancing and throughput optimization for heterogeneous systems subject to failures

Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
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
PARMI: a publish/subscribe based asynchronous RMI framework for cluster computing

HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Performance analysis of asynchronous Jacobi's method implemented in MPI, SHMEM and OpenMP

International Journal of High Performance Computing Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a previous work, we have shown the very high power of asynchronism for parallel iterative algorithms in a global context of grid computing. In this article, we study the interest of coupling load balancing with asynchronism in these algorithms. We propose a non-centralized version of dynamic load balancing which is best suited to asynchronism. After showing, by some experiments on a given ODE problem, that this technique can efficiently enhance the performances of our algorithms, we give some general conditions for the use of load balancing to obtain good results with this kind of algorithms.