Load Balancing White Papers
Tability of Load Balancing Algorithms in Dynamic Adversarial Systems
Overview In a distributed network of computing hosts, the performance of the system can depend crucially on dividing up work effectively across the participating nodes. This type of load balancing problem has been studied in many different models, centered around the idea that an algorithm should avoid creating "Hot spots" that degrade system performance. A basic model of load balancing is considered in a distributed network, which has formed the basis of a number of earlier studies. A network of identical processors is represented by an undirected graph G = (V;E). There are a number of jobs to be processed in the system, abstractly represented by unit-size tokens.
| Publisher | Rensselaer Polytechnic Institute | File Format | |
|---|---|---|---|
| Date Published | May 2007 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 3 out of 6 users found this white paper useful
White Paper RSS
Download
Register
