Skip to main content
Log in

The Convergence of Realistic Distributed Load-Balancing Algorithms

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We give a general model of partially asynchronous, distributed load-balancing algorithms for the discrete load model in parallel computers, where the processor loads are treated as non-negative integers. We prove that all load-balancing algorithms in this model are finite. This means that all load-balancing algorithms based on this model are guaranteed to reach a stable situation at a certain time (which depends on the particular algorithm) at which no load will be sent from one processor to another. With an additional assumption, we prove that the largest load difference between any two processors, in the final stable situation of the load-balancing algorithms in this model, is upper-bounded by the diameter of the topology.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to F. Cedo, A. Cortes, A. Ripoll, M.A. Senar or E. Luque.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cedo, F., Cortes, A., Ripoll, A. et al. The Convergence of Realistic Distributed Load-Balancing Algorithms. Theory Comput Syst 41, 609–618 (2007). https://doi.org/10.1007/s00224-006-1214-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-006-1214-1

Keywords

Navigation