Dynamic Programming and Greedy Heuristic in the Load Balancing Problem for the iFDAQ of the COMPASS Experiment at CERN.
Ondrej SubrtMartin BodlákVladimír JarýAntonín KvetonJosef NovýMiroslav ViriusMartin ZemkoPublished in: ISEEIE (2021)
Keyphrases
- load balancing
- greedy heuristic
- dynamic programming
- greedy algorithm
- knapsack problem
- np hard
- dynamic load balancing
- distributed systems
- peer to peer
- peer to peer systems
- fault tolerance
- round robin
- resource utilization
- fault tolerant
- load balancing strategy
- grid computing
- mobile agents
- data replication
- worst case
- load balance
- low overhead
- resource scheduling
- reinforcement learning
- response time
- optimal solution
- replication scheme
- parallel query processing