DocumentCode :
2472598
Title :
Load balancing over heterogeneous networks with gossip-based algorithms
Author :
Franceschelli, Mauro ; Giua, Alessandro ; Seatzu, Carla
Author_Institution :
Dept. of Electr. & Electron. Eng., Univ. of Cagliari, Cagliari, Italy
fYear :
2009
fDate :
10-12 June 2009
Firstpage :
1987
Lastpage :
1993
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.
Keywords :
distributed algorithms; multi-agent systems; random processes; resource allocation; gossip-based distributed algorithm; heterogeneous networks; load balancing; maximum execution time; random walk; Communication channels; Convergence; Costs; Distributed algorithms; Electrical capacitance tomography; Graph theory; Hardware; Load management; Parallel processing; Telecommunication traffic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
American Control Conference, 2009. ACC '09.
Conference_Location :
St. Louis, MO
ISSN :
0743-1619
Print_ISBN :
978-1-4244-4523-3
Electronic_ISBN :
0743-1619
Type :
conf
DOI :
10.1109/ACC.2009.5160452
Filename :
5160452
Link To Document :
بازگشت