Enhanced approach on solving Online Knapsack Problem to improve Load Balancing.
Marek GalinskiJuraj VolkoIvan KotuliakPublished in: TSP (2020)
Keyphrases
- load balancing
- knapsack problem
- dynamic load balancing
- distributed systems
- combinatorial optimization problems
- randomly generated test instances
- fault tolerance
- load balance
- exact algorithms
- dynamic programming
- implicit enumeration
- fault tolerant
- low overhead
- optimal solution
- skewed data
- peer to peer
- grid computing
- round robin
- resource utilization
- optimization problems
- load balancing strategy
- peer to peer systems
- real time
- np hard
- mobile agents
- multimedia
- maximum profit
- computational complexity
- lower bound
- distributed environment
- load distribution
- scheduling problem
- machine learning