.png){kind=icon}
.png){kind=icon}
Return
Dynamic load balancing and efficient load estimators for asynchronous iterative algorithms
.png){kind=icon}
OA
AI
DOI：10.1109/TPDS.2005.45.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In a previous paper [1], 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 such algorithms. After proposing a noncentralized version of dynamic load balancing which is best suited to asynchronism, we verify its efficiency by some experiments on a general Partial Differential Equation (PDE) problem. Finally, we give some general conditions for the use of load balancing to obtain good results with this kind of algorithm and discuss the choice of the residual as an efficient load estimator.
Keywords:
parallel iterative algorithms
asynchronism
load-balancing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
No organization information available