An empirical study of static load balancing algorithms

Abstract

Empirically compares a variety of current algorithms used to map scientific computations onto massively parallel computers. The comparison is performed using Chaco, a publicly available graph partitioning code written by the authors. Algorithms are evaluated in terms of both computing cost and quality of partition, as judged by the execution time of the parallel application.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>