An Automatic Adjustment Approach of Thread Quantity to Optimize Resource Usage

In order to achieve optimization of resource usage for servers, a method is designed to automatically adjust- ment approach of thread quantity when multiple types of tasks are running, which can effectively and automatically opti- mize resource utilization without manual intervention. It first monitors different kinds of resources and trains resource us- age of servers when adding a thread for a type of task. It then dynamically adds or reduces thread quantity to adapt to the scenario of dynamic change in resource usage according to monitoring results. When resources are idle and thread quanti- ty needs to be added, the problem of determining thread quantity is abstracted by multi-dimensional container loading problem and we propose a heuristic algorithm based on similar ratio which can quickly obtain thread quantity. The pro- posed algorithm not only avoids the work of setting thread quantity for parallel tasks, but also improves the utilization rate of CPU, I/O and throughput.

[1]  Zuo Chao-shu Approximate optimization thread quantity of inner communication in distributed parallel server , 2005 .

[2]  Harald Dyckhoff,et al.  Cutting and Packing in Production and Distribution , 1992 .

[3]  Gleb Belov,et al.  A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths , 2002, Eur. J. Oper. Res..

[4]  Wang Li-sheng Research on optimal thread quantity of real-time signals acquisition system , 2011 .

[5]  L. V. Kantorovich,et al.  Mathematical Methods of Organizing and Planning Production , 1960 .

[6]  Li-Li Zhang,et al.  A multi-layer heuristic search algorithm for three dimensional container loading problem , 2012 .

[7]  Athanasios V. Vasilakos,et al.  Managing Performance Overhead of Virtual Machines in Cloud Computing: A Survey, State of the Art, and Future Directions , 2014, Proceedings of the IEEE.

[8]  He Kun,et al.  Efficient Algorithm Based on Action Space for Solving the 2D Rectangular Packing Problem , 2012 .

[9]  Mhand Hifi,et al.  High Performance Peer-to-Peer Distributed Computing with Application to Constrained Two-Dimensional Guillotine Cutting Problem , 2011, International Euromicro Conference on Parallel, Distributed and Network-Based Processing.

[10]  Yan Jin,et al.  Efficient Algorithm Based on Action Space for Solving the 2D Rectangular Packing Problem: Efficient Algorithm Based on Action Space for Solving the 2D Rectangular Packing Problem , 2012 .

[11]  Eduardo C. Xavier,et al.  A one-dimensional bin packing problem with shelf divisions , 2008, Discret. Appl. Math..

[12]  Harald Dyckhoff,et al.  Cutting and packing in production and distribution : a typology and bibliography , 1992 .

[13]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[14]  Emmanouil E. Zachariadis,et al.  A Hybrid Metaheuristic Algorithm for the Integrated Vehicle Routing and Three-Dimensional Container-Loading Problem , 2009, IEEE Transactions on Intelligent Transportation Systems.