A Dynamic and Efficient Resource Management by using Heuristics Algorithm

Dynamic resource management for a large-scale cloud environment is problematic one. We propose a gossip protocol that ensures fair resource allocation among sites/applications, dynamically adapts the allocation to load changes and scales both in the number of physical machines and sites/applications. We present a protocol that computes an optimal solution without considering memory constraints and prove correctness and convergence properties. Next, we extend that protocol to provide an efficient heuristic solution for the complete problem, which includes minimizing the cost for adapting an allocation. The protocol continuously executes on dynamic, local input and does not require global synchronization, as other proposed gossip protocols do.