TY - GEN
T1 - Minimizing cost of virtual machines for deadline-constrained MapReduce applications in the cloud
AU - Hwang, Eunji
AU - Kim, Kyong Hoon
PY - 2012
Y1 - 2012
N2 - As Cloud computing provides Anything as a Service (XaaS), many applications can be developed and run on the Cloud without concerns of platforms. Data-incentive applications are also easily developed on virtual machines provided by the Cloud. In this work, we investigate cost-effective resource provisioning for MapReduce applications with deadline constraints, as the MapReduce programming model is useful and powerful in developing data-incentive applications. When users want to run MapReduce applications, they submit jobs to a Cloud resource broker which allocates appropriate virtual machines with consideration of SLAs (Service-Level Agreements). The goal of resource provisioning in this paper is to minimize the cost of virtual machines for executing MapReduce applications without violating their deadlines to be finished by. We propose two resource provisioning approaches: one based on listed pricing policies and the other based on deadline-aware tasks packing. Throughout simulations, we evaluate and analyze them in various ways.
AB - As Cloud computing provides Anything as a Service (XaaS), many applications can be developed and run on the Cloud without concerns of platforms. Data-incentive applications are also easily developed on virtual machines provided by the Cloud. In this work, we investigate cost-effective resource provisioning for MapReduce applications with deadline constraints, as the MapReduce programming model is useful and powerful in developing data-incentive applications. When users want to run MapReduce applications, they submit jobs to a Cloud resource broker which allocates appropriate virtual machines with consideration of SLAs (Service-Level Agreements). The goal of resource provisioning in this paper is to minimize the cost of virtual machines for executing MapReduce applications without violating their deadlines to be finished by. We propose two resource provisioning approaches: one based on listed pricing policies and the other based on deadline-aware tasks packing. Throughout simulations, we evaluate and analyze them in various ways.
UR - https://www.scopus.com/pages/publications/84869031497
U2 - 10.1109/Grid.2012.19
DO - 10.1109/Grid.2012.19
M3 - Conference contribution
AN - SCOPUS:84869031497
SN - 9780769548159
T3 - Proceedings - IEEE/ACM International Workshop on Grid Computing
SP - 130
EP - 138
BT - Proceedings - 13th ACM/IEEE International Conference on Grid Computing, Grid 2012
T2 - 13th ACM/IEEE International Conference on Grid Computing, Grid 2012
Y2 - 20 September 2012 through 23 September 2012
ER -