Traditional load balancing algorithms for data-intensive iterative routines can successfully load balance relatively small problems. We demonstrate that they may fail for large problem sizes on computational clusters with memory heterogeneity. Traditional algorithms use too simplistic models of processors performance which cannot reflect many aspects of heterogeneity. This paper presents a new dynamic load balancing algorithm based on the advanced functional performance model. The model consists of speed functions of problem size, which are built adaptively from a history of load measurements. Experimental results demonstrate that our algorithm can successfully balance data-intensive iterative routines on parallel platforms with memory heterogeneity. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Clarke, D., Lastovetsky, A., & Rychkov, V. (2011). Dynamic load balancing of parallel computational iterative routines on platforms with memory heterogeneity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6586 LNCS, pp. 41–50). https://doi.org/10.1007/978-3-642-21878-1_6
Mendeley helps you to discover research relevant for your work.