Load balancing over heterogeneous networks with gossip-based algorithms

  • Authors:
  • Mauro Franceschelli;Alessandro Giua;Carla Seatzu

  • Affiliations:
  • Department of Electrical and Electronic Engineering, University of Cagliari, Cagliari, Italy;Department of Electrical and Electronic Engineering, University of Cagliari, Cagliari, Italy;Department of Electrical and Electronic Engineering, University of Cagliari, Cagliari, Italy

  • Venue:
  • ACC'09 Proceedings of the 2009 conference on American Control Conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we consider the problem of load balancing over heterogeneous networks, i.e. networks whose nodes have different speeds. We assume that tasks are indivisible and with different weights. Our goal is that of minimizing the maximum execution time over nodes. We provide a gossip-based distributed algorithm whose convergence to a bounded set is guaranteed. We show that the convergence time of the proposed algorithm relies ultimately on the average meeting time between two agents performing a random walk on a graph.