TY - GEN
T1 - A novel performance preserving VM Splitting and Assignment Scheme
AU - Liu, Liu
AU - Xu, Jie
AU - Yu, Hongfang
AU - Li, Lemin
AU - Qiao, Chunming
PY - 2014
Y1 - 2014
N2 - Server consolidation schemes whereby each server is replaced with a virtual machine (VM) and multiple such VMs are run on a single physical server can reduce the number of physical servers needed, and in turn, both the cost and energy consumption in datacenters. However, existing schemes have not fully exploited the flexibility in the usage and allocation of virtualization resources, so as to allow one application originally deployed on a single large VM (LVM) to be split and hosted by multiple smaller VMs (SVM). Using multiple SVM instead of a LVM enables resource allocation at a smaller granularity and hence may further increase the utilization and reduce the number of physical servers. However, a major challenge to be overcome when deploying multiple SVMs for one application is to preserve the performance of the application in terms of e.g., response delay. In this paper, we show through experiment based data analysis that in order to preserve the performance of the application, one needs to allocate sufficient resources to each SVM, and the total amount of resources required by all the SVMs will exceed that required by the LVM. Nevertheless, we also show that by using the proposed heuristic algorithm called VM Splitting and Assignment (VMSA), we can substantially improve the utilization and reduce the number of physical servers.
AB - Server consolidation schemes whereby each server is replaced with a virtual machine (VM) and multiple such VMs are run on a single physical server can reduce the number of physical servers needed, and in turn, both the cost and energy consumption in datacenters. However, existing schemes have not fully exploited the flexibility in the usage and allocation of virtualization resources, so as to allow one application originally deployed on a single large VM (LVM) to be split and hosted by multiple smaller VMs (SVM). Using multiple SVM instead of a LVM enables resource allocation at a smaller granularity and hence may further increase the utilization and reduce the number of physical servers. However, a major challenge to be overcome when deploying multiple SVMs for one application is to preserve the performance of the application in terms of e.g., response delay. In this paper, we show through experiment based data analysis that in order to preserve the performance of the application, one needs to allocate sufficient resources to each SVM, and the total amount of resources required by all the SVMs will exceed that required by the LVM. Nevertheless, we also show that by using the proposed heuristic algorithm called VM Splitting and Assignment (VMSA), we can substantially improve the utilization and reduce the number of physical servers.
UR - https://www.scopus.com/pages/publications/84907003796
U2 - 10.1109/ICC.2014.6883982
DO - 10.1109/ICC.2014.6883982
M3 - Conference contribution
AN - SCOPUS:84907003796
SN - 9781479920037
T3 - 2014 IEEE International Conference on Communications, ICC 2014
SP - 4215
EP - 4220
BT - 2014 IEEE International Conference on Communications, ICC 2014
PB - IEEE Computer Society
T2 - 2014 1st IEEE International Conference on Communications, ICC 2014
Y2 - 10 June 2014 through 14 June 2014
ER -