Paper Info
Title
Gossip-based resource allocation for green computing in large clouds
Abstract
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.
Year
Venue
Keywords
2011
CNSM
green computing,cloud configuration,gossip-based resource allocation,resource allocation,memory capacity,large-scale cloud environment,generic gossip protocol,resource allocation process scalable,fair allocation,cpu resource,generic protocol,large cloud,memory constraint,middleware,computer architecture,gossip protocols,satisfiability,protocols,resource management,optimization,servers,gossip protocol,cloud computing,resource manager
Field
DocType
ISSN
Resource management,Green computing,Computer science,Server,Computer network,Resource allocation (computer),Resource allocation,Gossip protocol,Distributed computing,Cloud computing,Scalability
Conference
2165-9605
ISBN
Citations 
PageRank 
978-1-4577-1588-4
9
0.57
References 
Authors
14
3
Name
Order
Citations
PageRank
Rerngvit Yanggratoke1635.77
Fetahi Wuhib218012.10
Rolf Stadler370670.88