Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Gossip-based Resource Allocation for Green Computing in Large Clouds (long version)
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. (Kommunikationsnät, Communication Networks)ORCID iD: 0000-0002-2680-9065
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. (Kommunikationsnät, Communication Networks)
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. (Kommunikationsnät, Communication Networks)
2011 (English)Report (Other academic)
Abstract [en]

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.
Keyword [en]
Cloud computing, green computing, distributed management, power management, resource allocation, gossip protocols, server consolidation
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:kth:diva-37064OAI: oai:DiVA.org:kth-37064DiVA: diva2:431945
Funder
ICT - The Next Generation
Note
A short version of this paper appears in the 7th International Conference on Network and Service Management,Paris, France, 24-28 October, 2011. QC 20110809Available from: 2011-08-09 Created: 2011-07-27 Last updated: 2011-10-30Bibliographically approved

Open Access in DiVA

fulltext(685 kB)772 downloads
File information
File name FULLTEXT02.pdfFile size 685 kBChecksum SHA-512
4fa81feabb4d0332938046befa862609152cb1e585b4067fe509e1a8e16d949a7854df277fbe7f6f23a2a05872de4e0fffe47940f4c7669e32b47502bc4e1749
Type fulltextMimetype application/pdf

Authority records BETA

Yanggratoke, Rerngvit

Search in DiVA

By author/editor
Yanggratoke, RerngvitWuhib, FetahiStadler, Rolf
By organisation
ACCESS Linnaeus Centre
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 776 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 306 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf