Gossip-based Resource Allocation for Green Computing in Large Clouds (long version)
2011 (English)Report (Other academic)
We address the problem of resource allocation in a large-scale cloud environment, which we formalize as that of dynamically optimizing a cloud configuration for green computing objectives under CPU and memory constraints. We propose a generic gossip protocol for resource allocation which can be instantiated for specific objectives. We develop an instantiation of this generic protocol which aims at minimizing power consumption through server consolidation, while satisfying a changing load pattern. This protocol, called GRMP-Q, provides an efficient heuristic solution that performs well in most cases---in special cases it is optimal. Under overload, the protocol gives a fair allocation of CPU resources to clients. Simulation results suggest that key performance metrics do not change with increasing system size, making the resource allocation process scalable to well above 100,000 servers. Generally, the effectiveness of the protocol in achieving its objective increases with increasing memory capacity in the servers.
Place, publisher, year, edition, pages
2011. , 12 p.
Cloud computing, green computing, distributed management, power management, resource allocation, gossip protocols, server consolidation
IdentifiersURN: urn:nbn:se:kth:diva-37064OAI: oai:DiVA.org:kth-37064DiVA: diva2:431945
FunderICT - The Next Generation
A short version of this paper appears in the 7th International Conference on Network and Service Management,Paris, France, 24-28 October, 2011.
QC 201108092011-08-092011-07-272011-10-30Bibliographically approved