Abstract
The paper studies emergence of coalitions for optimal load-balancing among compute nodes in large distributed systems. A compute node in our model is a rational agent that tries to minimize the difference between its load and the average load of other nodes in the vicinity. By limiting communication within the clusters, the cost of communication necessary for dynamic load-balancing is dramatically decreased.
Original language | English (US) |
---|---|
Pages | 528-535 |
Number of pages | 8 |
DOIs | |
State | Published - 2003 |
Event | 2003 Congress on Evolutionary Computation, CEC 2003 - Canberra, ACT, Australia Duration: Dec 8 2003 → Dec 12 2003 |
Other
Other | 2003 Congress on Evolutionary Computation, CEC 2003 |
---|---|
Country/Territory | Australia |
City | Canberra, ACT |
Period | 12/8/03 → 12/12/03 |
ASJC Scopus subject areas
- Computational Mathematics