Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Scalable Delivery of Dynamic Content Using a Cooperative Edge Cache Grid
IEEE Transactions on Knowledge and Data Engineering
Dynamic diffusion load balancing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Simple efficient load balancing algorithms for peer-to-peer systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
We study the long term (steady state) performance of a simple, randomized, local load balancing technique. We assume a system of n processors connected by an arbitrary network topology. Jobs are placed in the processors by a deterministic or randomized adversary. The adversary knows the current and past load distribution in the network and can use this information to place the new tasks in the processors. The adversary can put a number of new jobs in each processor, in each step, as long as the (expected) total number of new jobs arriving at a given step is bounded by \lambda n A node can execute one job per step, and also participate in one load balancing operation in which it can move tasks to a direct neighbor in the network. In the protocol we analyze here, a node equalizes its load with a random neighbor in the graph.We first study the stability of a system running our load balancing protocol. Clearly, if \lambda 1 the system cannot be stable. We show that for any \lambda