By Topic

Coupling dynamic load balancing with asynchronism in iterative algorithms on the computational grid

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bahi, J.M. ; Lab. d''Informatique de Franche-Comte, IUT de Belfort-Montbeliard, Belfort, France ; Contassot-Vivier, S. ; Couturier, R.

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 performance of our algorithms, we give some general conditions for the use of load balancing to obtain good results with this kind of algorithm.

Published in:

Parallel and Distributed Processing Symposium, 2003. Proceedings. International

Date of Conference:

22-26 April 2003