TY - GEN
T1 - Dynamic resource allocation in cloud environment under time-variant job requests
AU - Tammaro, Davide
AU - Doumith, Elias A.
AU - Al Zahr, Sawsan
AU - Smets, Jean Paul
AU - Gagnaire, Maurice
PY - 2011/1/1
Y1 - 2011/1/1
N2 - In Cloud environments, efficient resource provisioning and management present today a challenging issue because of the dynamic nature of the Cloud on one hand, and the need to satisfy heterogeneous resource requirements on the other hand. In such dynamic environments where end-users can arrive and leave the Cloud at any time, a Cloud service provider (CSP) should be able to make accurate decisions for scaling up or down its data-centers while taking into account several utility criteria, e.g., the delay of virtual resources setup, the migration of existing processes, the resource utilization, etc. In order to satisfy both parties (the CSP and the end-users), an efficient and dynamic resource allocation strategy is mandatory. In this paper, we propose an original approach for dynamic resource allocation in a Cloud environment. Our proposal considers computing job requests that are characterized by their arrival and teardown times, as well as a predictive profile of their computing requirements during their activity period. Assuming a prior knowledge of the predicted computing resources required by end-users, we propose and investigate several algorithms with different optimization criteria. However, prediction errors may occur resulting in some cases in the drop of one or several computing requests. Our proposed algorithms are compared in terms of various performance parameters including the rejection ratio, the dropping ratio, as well as the satisfaction of the endusers and the CSP.
AB - In Cloud environments, efficient resource provisioning and management present today a challenging issue because of the dynamic nature of the Cloud on one hand, and the need to satisfy heterogeneous resource requirements on the other hand. In such dynamic environments where end-users can arrive and leave the Cloud at any time, a Cloud service provider (CSP) should be able to make accurate decisions for scaling up or down its data-centers while taking into account several utility criteria, e.g., the delay of virtual resources setup, the migration of existing processes, the resource utilization, etc. In order to satisfy both parties (the CSP and the end-users), an efficient and dynamic resource allocation strategy is mandatory. In this paper, we propose an original approach for dynamic resource allocation in a Cloud environment. Our proposal considers computing job requests that are characterized by their arrival and teardown times, as well as a predictive profile of their computing requirements during their activity period. Assuming a prior knowledge of the predicted computing resources required by end-users, we propose and investigate several algorithms with different optimization criteria. However, prediction errors may occur resulting in some cases in the drop of one or several computing requests. Our proposed algorithms are compared in terms of various performance parameters including the rejection ratio, the dropping ratio, as well as the satisfaction of the endusers and the CSP.
U2 - 10.1109/CloudCom.2011.91
DO - 10.1109/CloudCom.2011.91
M3 - Conference contribution
AN - SCOPUS:84857163548
SN - 9780769546223
T3 - Proceedings - 2011 3rd IEEE International Conference on Cloud Computing Technology and Science, CloudCom 2011
SP - 592
EP - 598
BT - Proceedings - 2011 3rd IEEE International Conference on Cloud Computing Technology and Science, CloudCom 2011
PB - IEEE Computer Society
T2 - 3rd IEEE International Conference on Cloud Computing Technology and Science, CloudCom 2011
Y2 - 29 November 2011 through 1 December 2011
ER -