Load Balancing White Papers
Load Balancing in Distributed Systems: An Approach Using Cooperative Games
Overview This paper formulates the static load balancing problem in single class job distributed systems as a cooperative game among computers. It is shown that the Nash Bargaining Solution (NBS) provides a Pareto optimal allocation which is also fair to all jobs. It proposes a cooperative load balancing game and presents the structure of the NBS. For this game an algorithm for computing NBS is derived. The paper shows that the fairness index is always 1 using NBS which means that the allocation is fair to all jobs. Finally, the performance of the cooperative load balancing scheme is compared with that of other existing schemes.
| Publisher | University of Texas | File Format | |
|---|---|---|---|
| Date Published | April 2002 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 2 out of 4 users found this white paper useful
White Paper RSS
Download
Register
