File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/3177755
- Scopus: eid_2-s2.0-85074675817
- WOS: WOS:000426879700005
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: An Online Emergency Demand Response Mechanism for Cloud Computing
Title | An Online Emergency Demand Response Mechanism for Cloud Computing |
---|---|
Authors | |
Keywords | Approximation algorithms Cloud computing Demand response Mechanism design |
Issue Date | 2018 |
Publisher | ACM Special Interest Group. The Journal's web site is located at http://tompecs.acm.org/ |
Citation | ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2018, v. 3 n. 1, article no. 5 How to Cite? |
Abstract | This article studies emergency demand response (EDR) mechanisms from a data center perspective, where a cloud participates in a mandatory EDR program while receiving computing job bids from cloud users in an online fashion. We target a realistic EDR mechanism where (i) the cloud provider dynamically packs different types of resources on servers into requested VMs and computes job schedules to meet users’ requirements, (ii) the power consumption of servers in the cloud is limited by the grid through the EDR program, and (iii) the operation cost of the cloud is considered in the calculation of social welfare, measured by an electricity cost that consists of both volume charge and peak charge. We propose an online auction for dynamic cloud resource provisioning that is under the control of the EDR program, runs in polynomial time, achieves truthfulness, and close-to-optimal social welfare for the cloud ecosystem. In the design of the online auction, we first propose a new framework, compact exponential LPs, to handle job scheduling constraints in the time domain. We then develop a posted pricing auction framework toward the truthful online auction design, which leverages the classic primal-dual technique for approximation algorithm design. We evaluate our online auctions through both theoretical analysis and empirical studies driven by real-world traces. |
Persistent Identifier | http://hdl.handle.net/10722/259905 |
ISSN | 2023 Impact Factor: 0.7 2023 SCImago Journal Rankings: 0.525 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhou, R | - |
dc.contributor.author | Li, Z | - |
dc.contributor.author | Wu, C | - |
dc.date.accessioned | 2018-09-03T04:16:14Z | - |
dc.date.available | 2018-09-03T04:16:14Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2018, v. 3 n. 1, article no. 5 | - |
dc.identifier.issn | 2376-3639 | - |
dc.identifier.uri | http://hdl.handle.net/10722/259905 | - |
dc.description.abstract | This article studies emergency demand response (EDR) mechanisms from a data center perspective, where a cloud participates in a mandatory EDR program while receiving computing job bids from cloud users in an online fashion. We target a realistic EDR mechanism where (i) the cloud provider dynamically packs different types of resources on servers into requested VMs and computes job schedules to meet users’ requirements, (ii) the power consumption of servers in the cloud is limited by the grid through the EDR program, and (iii) the operation cost of the cloud is considered in the calculation of social welfare, measured by an electricity cost that consists of both volume charge and peak charge. We propose an online auction for dynamic cloud resource provisioning that is under the control of the EDR program, runs in polynomial time, achieves truthfulness, and close-to-optimal social welfare for the cloud ecosystem. In the design of the online auction, we first propose a new framework, compact exponential LPs, to handle job scheduling constraints in the time domain. We then develop a posted pricing auction framework toward the truthful online auction design, which leverages the classic primal-dual technique for approximation algorithm design. We evaluate our online auctions through both theoretical analysis and empirical studies driven by real-world traces. | - |
dc.language | eng | - |
dc.publisher | ACM Special Interest Group. The Journal's web site is located at http://tompecs.acm.org/ | - |
dc.relation.ispartof | ACM Transactions on Modeling and Performance Evaluation of Computing Systems | - |
dc.rights | ACM Transactions on Modeling and Performance Evaluation of Computing Systems. Copyright © ACM Special Interest Group. | - |
dc.subject | Approximation algorithms | - |
dc.subject | Cloud computing | - |
dc.subject | Demand response | - |
dc.subject | Mechanism design | - |
dc.title | An Online Emergency Demand Response Mechanism for Cloud Computing | - |
dc.type | Article | - |
dc.identifier.email | Wu, C: cwu@cs.hku.hk | - |
dc.identifier.authority | Wu, C=rp01397 | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1145/3177755 | - |
dc.identifier.scopus | eid_2-s2.0-85074675817 | - |
dc.identifier.hkuros | 288747 | - |
dc.identifier.volume | 3 | - |
dc.identifier.issue | 1 | - |
dc.identifier.spage | article no. 5 | - |
dc.identifier.epage | article no. 5 | - |
dc.identifier.isi | WOS:000426879700005 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 2376-3639 | - |