An efficient polynomial time approximation scheme for load balancing on uniformly related machines.
Leah EpsteinAsaf LevinPublished in: Math. Program. (2014)
Keyphrases
- load balancing
- polynomial time approximation
- identical machines
- np hard
- dynamic load balancing
- approximation algorithms
- replication scheme
- error bounds
- fault tolerance
- distributed systems
- grid computing
- load balance
- peer to peer
- fault tolerant
- mobile agents
- round robin
- data replication
- load balancing strategy
- resource utilization
- low overhead
- parallel database systems
- upper bound
- scheduling problem
- special case
- load distribution
- skewed data
- reinforcement learning
- multimedia