Dynamic Load Balancing with Group Communication

Author: S. Dolev, R. Segala, A. Shvartsman

Appears: in Theoretical Computer Science 369, pages 348-360, 2006.

Also: Proceedings of International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lacanau, France, pages 111-125, July 1999.

Abstract: This work considers the problem of efficiently performing a set of tasks using a network of processors in the setting where the network is subject to dynamic reconfigurations, including partitions and merges. A key challenge for this setting is the implementation of dynamic load balancing that reduces the number of tasks that are performed redundantly because of the reconfigurations. We explore new approaches for load balancing in dynamic networks that can be employed by applications using a group communication service. The group communication services that we consider include a membership service (establishing new groups to reflect dynamic changes) but does not include maintenance of a primary component. For the n-processor, n-task load balancing problem defined in this work, the following specific results are obtained.

For the case of fully dynamic changes including fragmentation and merges we show that the termination time of any on-line task assignment algorithm is greater than the termination time of an off-line task assignment algorithm by a factor greater than n/12.

We present a load balancing algorithm that guarantees completion of all tasks in all fragments caused by partitions with work O(n+f n) in the presence of f fragmentation failures.

We develop an effective scheduling strategy for minimizing the task execution redundancy and we prove that our strategy provides each of the n processors with a schedule of Theta (n^{1/3}) tasks such that at most one task is performed redundantly by any two processors.

Download the full paper from the publisher.

Download a preliminary version of the paper.

Download the extended abstract.