Dynamic load balancing with group communication

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 reduc...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 369; no. 1; pp. 348 - 360
Main Authors: Dolev, Shlomi, Segala, Roberto, Shvartsman, Alexander
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 15.12.2006
Elsevier
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Computer systems performance. Reliability
Dynamic networks
Exact sciences and technology
Flows in networks. Combinatorial problems
Group communications
Load balancing
Operational research and scientific management
Operational research. Management science
Scheduling
Software
Theoretical computing
Scheduling
Dynamic networks
Load balancing
Group communications
Computer theory
Redundancy
Maintenance
Algorithm
Group communication
Dynamic load
Fragmentation
Reconfiguration
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 (GCS). The GCS 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 Θ ( n 1 / 3 ) tasks such that at most one task is performed redundantly by any two processors.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2006.09.020