File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/CSC.2011.6138529
- Scopus: eid_2-s2.0-84863169430
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Social-optimized win-win resource allocation for self-organizing cloud
Title | Social-optimized win-win resource allocation for self-organizing cloud |
---|---|
Authors | |
Keywords | Availability Bandwidth Peer to peer computing Pricing Protocols Resource management Vectors |
Issue Date | 2011 |
Publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1800791 |
Citation | The 2011 International Conference on Cloud and Service Computing (CSC), Hong Kong, China, 12-14 December 2011. In Proceedings of CSC, 2011, p. 251-258 How to Cite? |
Abstract | With the increasing scale of applications and the number of users, we design a Self-organizing Cloud (SoC) which aims to make use of the distributed volunteer computers or dedicated machines to provide powerful computing ability. These resources are provisioned elastically according to user’s specific demand, by leveraging virtual machine (VM) resource isolation technology. Based on such a framework, we propose a social-optimized auction-based resource allocation scheme, which mainly tackles two issues: (1) how to make full use of the widely dispersed multi-attribute idle resources to construct a win-win situation, such that each task schedule could let both sides (resource providers and consumers) be satisfied with their final payoffs. (2) The total resource utility welfare should also be optimized to guarantee the overall performance around the global system. The key challenge of getting the win-win effect with social optimization is its provable NP-completeness. Finally, we validate that our approach can effectively improve the resource contributor’s payoffs up to about five times as the level without our method via simulation work. Meanwhile, our approach can also keep a high level of the processing rate for the task scheduling. |
Persistent Identifier | http://hdl.handle.net/10722/144629 |
ISBN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Di, S | en_US |
dc.contributor.author | Wang, CL | en_US |
dc.contributor.author | Cheng, L | en_US |
dc.contributor.author | Chen, L | en_US |
dc.date.accessioned | 2012-02-03T06:16:59Z | - |
dc.date.available | 2012-02-03T06:16:59Z | - |
dc.date.issued | 2011 | en_US |
dc.identifier.citation | The 2011 International Conference on Cloud and Service Computing (CSC), Hong Kong, China, 12-14 December 2011. In Proceedings of CSC, 2011, p. 251-258 | en_US |
dc.identifier.isbn | 978-1-4577-1637-9 | - |
dc.identifier.uri | http://hdl.handle.net/10722/144629 | - |
dc.description.abstract | With the increasing scale of applications and the number of users, we design a Self-organizing Cloud (SoC) which aims to make use of the distributed volunteer computers or dedicated machines to provide powerful computing ability. These resources are provisioned elastically according to user’s specific demand, by leveraging virtual machine (VM) resource isolation technology. Based on such a framework, we propose a social-optimized auction-based resource allocation scheme, which mainly tackles two issues: (1) how to make full use of the widely dispersed multi-attribute idle resources to construct a win-win situation, such that each task schedule could let both sides (resource providers and consumers) be satisfied with their final payoffs. (2) The total resource utility welfare should also be optimized to guarantee the overall performance around the global system. The key challenge of getting the win-win effect with social optimization is its provable NP-completeness. Finally, we validate that our approach can effectively improve the resource contributor’s payoffs up to about five times as the level without our method via simulation work. Meanwhile, our approach can also keep a high level of the processing rate for the task scheduling. | - |
dc.language | eng | en_US |
dc.publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1800791 | - |
dc.relation.ispartof | Proceedings of the International Conference on Cloud and Service Computing, CSC 2011 | en_US |
dc.subject | Availability | - |
dc.subject | Bandwidth | - |
dc.subject | Peer to peer computing | - |
dc.subject | Pricing | - |
dc.subject | Protocols | - |
dc.subject | Resource management | - |
dc.subject | Vectors | - |
dc.title | Social-optimized win-win resource allocation for self-organizing cloud | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Di, S: sdi@cs.hku.hk | en_US |
dc.identifier.email | Wang, CL: clwang@cs.hku.hk | - |
dc.identifier.email | Cheng, L: lwcheng@cs.hku.hk | - |
dc.identifier.email | Chen, L: ling.chen@siat.ac.cn | - |
dc.identifier.authority | Wang, CL=rp00183 | en_US |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/CSC.2011.6138529 | - |
dc.identifier.scopus | eid_2-s2.0-84863169430 | - |
dc.identifier.hkuros | 198272 | en_US |
dc.identifier.spage | 251 | - |
dc.identifier.epage | 258 | - |
dc.description.other | The 2011 International Conference on Cloud and Service Computing (CSC), Hong Kong, China, 12-14 December 2011. In Proceedings of CSC, 2011, p. 251-258 | - |