Managing data center resources using heuristic search

E.V. Zharikov

Abstract


The features of the cloud data center are analyzed from the point of view of resource management. The two-stage method for consolidating virtual machines based on the use of local beam search algorithm is proposed and investigated with aim to solve the problem of managing the resources of a cloud data center. In this paper, the work of heuristics of the first and second stages of the proposed method is analyzed. The beam search algorithm was developed for solving the data center resource management problem. The data about tasks and physical machines from the Google cluster-usage traces are used to evaluate the proposed method. The proposed method allows to switch to a low-power mode on average 56 percent of physical servers potentially identified for switching to sleep mode based on an upper estimate of the required capacity of resources. Virtual machine consolidation is performed taking into account the limitation of the permissible number of migrations per physical server.

Problems in programming 2017; 4: 016-027


Keywords


virtualization; resource management; cloud computing; heuristic search

Full Text:

PDF (Ukrainian)

References


Pires, F. L., & Barán, B. (2015, May). A virtual machine placement taxonomy. In Proc. of the 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid). pp. 159-168.

Ahmad, R. W., Gani, A., Hamid, S. H. A., Shiraz, M., Yousafzai, A., & Xia, F. (2015). A survey on virtual machine migration and server consolidation frameworks for cloud data centers. Journal of Network and Computer Applications, 52, pp. 11-25.

Telenyk, S., Zharikov, E., & Rolik, O. (2016, September). An approach to virtual machine placement in cloud data centers. In Radio Electronics & Info Communications (UkrMiCo), 2016 International Conference (pp. 1-6). IEEE.

Pires, F. L., & Barán, B. (2013, December). Multi-objective virtual machine placement with service level agreement: A memetic algorithm approach. In Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing (pp. 203-210). IEEE Computer Society.

Saber, T., Ventresque, A., Brandic, I., Thorburn, J., & Murphy, L. (2015, December). Towards a multi-objective vm reassignment for large decentralised data centres. 8th International Conference on Utility and Cloud Computing (UCC), 2015 IEEE/ACM (pp. 65-74). IEEE.

Eucalyptus community [Online] – Available from: http://open.eucalyptus.com/

Lee, S., Panigrahy, R., Prabhakaran, V., Ramasubramanian, V., Talwar, K., Uyeda, L., & Wieder, U. (2011). Validating heuristics for virtual machines consolidation. Microsoft Research, MSR-TR-2011-9, pp. 1-14.

Sharma, B., Chudnovsky, V., Hellerstein, J. L., Rifaat, R., & Das, C. R. (2011, October). Modeling and synthesizing task placement constraints in Google compute clusters. In Proceedings of the 2nd ACM Symposium on Cloud Computing (p. 3). ACM.

Mark, C. C. T., Niyato, D., & Chen-Khong, T. (2011, March). Evolutionary optimal virtual machine placement and demand forecaster for cloud computing. IEEE International Conference on Advanced Information Networking and Applications (AINA), (pp. 348-355). IEEE.

Gao, Y., Guan, H., Qi, Z., Hou, Y., & Liu, L. (2013). A multi-objective ant colony system algorithm for virtual machine placement in cloud computing. Journal of Computer and System Sciences, 79(8), pp. 1230-1242.

Ferreto, T., De Rose, C. A., & Heiss, H. U. (2011, August). Maximum migration time guarantees in dynamic server consolidation for virtualized data centers. In European Conference on Parallel Processing (pp. 443-454). Springer, Berlin, Heidelberg.

Wu, Y., Tang, M., & Fraser, W. (2012, October). A simulated annealing algorithm for energy efficient virtual machine placement. In IEEE International Conference on Systems, Man, and Cybernetics (SMC), 2012 (pp. 1245-1250). IEEE.

Reiss, C., Wilkes, J., & Hellerstein, J. L. (2011). Google cluster-usage traces: format+ schema. Google Inc., White Paper, 1-14.


Refbacks

  • There are currently no refbacks.