Fast multi-resource allocation with patterns in large scale cloud data center

Abstract How to achieve fast and efficient resource allocation is an important optimization problem of resource management in cloud data center. On one hand, in order to ensure the user experience of resource requesting, the system has to achieve fast resource allocation to timely process resource requests; on the other hand, in order to ensure the efficiency of resource allocation, how to allocate multi-dimensional resource requests to servers needs to be optimized, such that server's resource utilization can be improved. However, most of existing approaches focus on finding out the mapping of each specific resource request to each specific server. This makes the complexity of resource allocation problem increases with the size of data center. Thus, these approaches cannot achieve fast and efficient resource allocation for large-scale data center. To address this problem, we propose a pattern based resource allocation mechanism based on the following findings. In a real-world cloud environment, the resource requests are usually classified into limited types. Thus, the mechanism first utilizes this feature to generate pattern information, which indicates which types of resource requests are suitable to be allocated together to a server. Then, the mechanism uses the pattern information as guidelines to make fast resource allocation decision and fully utilize server's multidimensional resources. Simulation experiments based on real and synthetic traces have shown that our mechanism significantly improves system's resource utilization and reduces the overall number of used servers.

[1]  Jia Wang,et al.  Exploring Plan-Based Scheduling for Large-Scale Computing Systems , 2016, 2016 IEEE International Conference on Cluster Computing (CLUSTER).

[2]  Minjie Zhang,et al.  A belief propagation-based method for task allocation in open and dynamic cloud environments , 2017, Knowl. Based Syst..

[3]  Djamal Zeghlache,et al.  Energy Efficient VM Scheduling for Cloud Data Centers: Exact Allocation and Migration Algorithms , 2013, 2013 13th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing.

[4]  Wentong Cai,et al.  On First Fit Bin Packing for Online Cloud Server Allocation , 2016, 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

[5]  Rina Panigrahy,et al.  Heuristics for Vector Bin Packing , 2011 .

[6]  Ricardo Bianchini,et al.  Power and energy management for server systems , 2004, Computer.

[7]  Peng Zhang,et al.  Energy-Saving Virtual Machine Placement in Cloud Data Centers , 2013, 2013 13th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing.

[8]  Yogish Sabharwal,et al.  Reusable Resource Scheduling via Colored Interval Covering , 2016, 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

[9]  Haipeng Luo,et al.  Adaptive Resource Provisioning for the Cloud Using Online Bin Packing , 2014, IEEE Transactions on Computers.

[10]  Lionel Eyraud-Dubois,et al.  Optimizing Resource allocation while handling SLA violations in Cloud Computing platforms , 2013, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing.

[11]  Raymond H. Putra,et al.  Dependable virtual machine allocation , 2013, 2013 Proceedings IEEE INFOCOM.

[12]  Samuel P. Midkiff,et al.  Workload-Driven VM Consolidation in Cloud Data Centers , 2015, 2015 IEEE International Parallel and Distributed Processing Symposium.

[13]  Archana Ganapathi,et al.  Analysis and Lessons from a Publicly Available Google Cluster Trace , 2010 .

[14]  Andrew Warfield,et al.  Live migration of virtual machines , 2005, NSDI.

[15]  Wentong Cai,et al.  Dynamic Bin Packing for On-Demand Cloud Resource Allocation , 2016, IEEE Transactions on Parallel and Distributed Systems.

[16]  Fang Dong,et al.  Performance evaluation and analysis of SEU Cloud Computing Platform — Using general benchmarks and real world AMS application , 2012, 2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[17]  Xueyan Tang,et al.  Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time , 2016, SPAA.

[18]  Xiaodong Liu,et al.  A speculative approach to spatial-temporal efficiency with multi-objective optimization in a heterogeneous cloud environment , 2016, Secur. Commun. Networks.

[19]  Rajkumar Buyya,et al.  Virtual Machine Consolidation in Cloud Data Centers Using ACO Metaheuristic , 2014, Euro-Par.

[20]  Robert N. M. Watson,et al.  Firmament: Fast, Centralized Cluster Scheduling at Scale , 2016, OSDI.

[21]  Alexander L. Stolyar,et al.  Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints , 2015, Queueing Syst. Theory Appl..

[22]  Javad Ghaderi,et al.  Randomized algorithms for scheduling VMs in the cloud , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[23]  R. Srikant,et al.  Asymptotic optimality of BestFit for stochastic bin packing , 2014, PERV.

[24]  Henri Casanova,et al.  Virtual Machine Resource Allocation for Service Hosting on Heterogeneous Distributed Platforms , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium.

[25]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[26]  Alexander L. Stolyar,et al.  A large-scale service system with packing constraints: minimizing the number of occupied servers , 2013, SIGMETRICS '13.

[27]  Srikanth Kandula,et al.  Multi-resource packing for cluster schedulers , 2014, SIGCOMM.

[28]  Fang Hao,et al.  Online allocation of virtual machines in a distributed cloud , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.