An introduction to stochastic bin packing-based server consolidation with conflicts

The energy consumption of large-scale data centers or server clusters is expected to grow significantly in the next couple of years contributing to up to 13% of the worldwide energy demand in 2030. As the involved processing units require a disproportional amount of energy when they are idle, underutilized, or overloaded, balancing the supply of and the demand for computing resources is a key issue to obtain energy-efficient server consolidations. Whereas traditional concepts mostly consider deterministic predictions of the future workloads or only aim at finding approximate solutions, in this article, we propose an exact approach to tackle the problem of assigning jobs with (not necessarily independent) stochastic characteristics to a minimal amount of servers subject to further practically relevant constraints. As a main contribution, the problem under consideration is reformulated as a stochastic bin packing problem with conflicts and modeled by an integer linear program. Finally, this new approach is tested on real-world instances obtained from a Google data center.

[1]  N. Jones.  How to stop data centres from gobbling up the world’s electricity , 2018, Nature.

[2]  Anders S. G. Andrae,et al.  Emerging Trends in Electricity Consumption for Consumer ICT , 2013 .

[3]  Fabio Furini,et al.  Theoretical and computational study of several linearisation techniques for binary quadratic problems , 2019, Ann. Oper. Res..

[4]  Zsolt Tuza,et al.  Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9 , 2013, Theor. Comput. Sci..

[5]  Pamela H. Vance,et al.  Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem , 1998, Comput. Optim. Appl..

[6]  Barry O'Sullivan,et al.  The Temporal Bin Packing Problem: An Application to Workload Management in Data Centres , 2016, 2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI).

[7]  Mauro Dell'Amico,et al.  A branch-and-price algorithm for the temporal bin packing problem , 2019, Comput. Oper. Res..

[8]  Sunilkumar S. Manvi,et al.  Resource management for Infrastructure as a Service (IaaS) in cloud computing: A survey , 2014, J. Netw. Comput. Appl..

[9]  Ming Zhang,et al.  Understanding data center traffic characteristics , 2010, CCRV.

[10]  Andreas Fischer,et al.  Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation , 2018, 4OR.

[11]  Vincenzo Mancuso,et al.  A measurement-based analysis of the energy consumption of data center servers , 2014, e-Energy.

[12]  Alexander Schill,et al.  Power Consumption Estimation Models for Processors, Virtual Machines, and Servers , 2014, IEEE Transactions on Parallel and Distributed Systems.

[13]  Deng Pan,et al.  Efficient VM placement with multiple deterministic and stochastic resources in data centers , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[14]  Christel Baier,et al.  Architecture and Advanced Electronics Pathways Toward Highly Adaptive Energy- Efficient Computing , 2019, Proceedings of the IEEE.

[15]  Yuval Rabani,et al.  Allocating Bandwidth for Bursty Connections , 2000, SIAM J. Comput..

[16]  Albert G. Greenberg,et al.  The nature of data center traffic: measurements & analysis , 2009, IMC '09.

[17]  Nursen Aydin,et al.  Multi-objective temporal bin packing problem: An application in cloud computing , 2020, Comput. Oper. Res..

[18]  Waltenegus Dargie,et al.  A Stochastic Model for Estimating the Power Consumption of a Processor , 2015, IEEE Transactions on Computers.

[19]  Morteza Zadimoghaddam,et al.  Overcommitment in Cloud Services: Bin Packing with Chance Constraints , 2019, Manag. Sci..

[20]  Alexander Schill,et al.  Extending the Cutting Stock Problem for Consolidating Services with Stochastic Workloads , 2018, IEEE Transactions on Parallel and Distributed Systems.

[21]  Cláudio Alves,et al.  Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints , 2017, Eur. J. Oper. Res..

[22]  José M. Valério de Carvalho,et al.  LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..

[23]  S. Kataoka.  A Stochastic Programming Model , 1963 .

[24]  Farokh B. Bastani,et al.  Workload Estimation for Improving Resource Management Decisions in the Cloud , 2015, 2015 IEEE Twelfth International Symposium on Autonomous Decentralized Systems.

[25]  Abolfazl Toroghi Haghighat,et al.  A stochastic process-based server consolidation approach for dynamic workloads in cloud data centers , 2018, The Journal of Supercomputing.

[26]  J. Koomey.  Worldwide electricity used in data centers , 2008 .

[27]  Gleb Belov,et al.  A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting , 2006, Eur. J. Oper. Res..

[28]  Anders S. G. Andrae,et al.  On Global Electricity Usage of Communication Technology: Trends to 2030 , 2015 .

[29]  João Pedro Pedroso,et al.  Bin packing and related problems: General arc-flow formulation with graph compression , 2013, Comput. Oper. Res..

[30]  Andrew Lim,et al.  A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems , 2020, INFORMS J. Comput..

[31]  Jaume Salom,et al.  Energy efficiency and renewable energy integration in data centres. Strategies and modelling review , 2015 .

[32]  José M. Valério de Carvalho,et al.  Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..

[33]  John Martinovic,et al.  A Stochastic Bin Packing Approach for Server Consolidation with Conflicts , 2019, OR.

[34]  Ashish Goel,et al.  Stochastic load balancing and related problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[35]  John Martinovic,et al.  Compact integer linear programming formulations for the temporal bin packing problem with fire-ups , 2021, Comput. Oper. Res..

[36]  Guofei Jiang,et al.  Effective VM sizing in virtualized data centers , 2011, 12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops.

[37]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[38]  Stephen D. Shapiro,et al.  Performance of Heuristic Bin Packing Algorithms with Segments of Random Length , 1977, Inf. Control..

[39]  Fred W. Glover,et al.  Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program , 1974, Oper. Res..

[40]  George L. Nemhauser,et al.  Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..

[41]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[42]  Yi Pan,et al.  Stochastic Load Balancing for Virtual Resource Management in Datacenters , 2020, IEEE Transactions on Cloud Computing.

[43]  J. M. Valério de Carvalho.  Exact solution of bin‐packing problems using column generation and branch‐and‐bound , 1999 .

[44]  Manuel Iori,et al.  Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems , 2020, INFORMS J. Comput..

[45]  José M. Valério de Carvalho,et al.  A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems , 2018, Eur. J. Oper. Res..

[46]  Waltenegus Dargie.  Tensor-Based Resource Utilization Characterization in a Large-Scale Cloud Infrastructure , 2019, UCC.

[47]  Daniele Vigo,et al.  Bin packing approximation algorithms: Survey and classification , 2013 .

[48]  N. Balakrishnan,et al.  A Primer on Statistical Distributions , 2003 .

[49]  Meng Wang,et al.  Consolidating virtual machines with dynamic bandwidth demand in data centers , 2011, 2011 Proceedings IEEE INFOCOM.

[50]  Micha Hofri,et al.  A Stochastic Model of Bin-Packing , 1980, Inf. Control..

[51]  Yongqiang Wu.  Energy efficient virtual machine placement in data centers , 2013 .

[52]  Manuel Iori,et al.  Bin packing and cutting stock problems: Mathematical models and exact algorithms , 2016, Eur. J. Oper. Res..

[53]  F. S. Hillier,et al.  Chance-Constrained Programming with 0-1 or Bounded Continuous Decision Variables , 1967 .

[54]  N. Harris,et al.  Identifying optimal areas for REDD intervention: East Kalimantan, Indonesia as a case study , 2008 .

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

[56]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[57]  Harald Dyckhoff,et al.  A New Linear Programming Approach to the Cutting Stock Problem , 1981, Oper. Res..

[58]  Jordi Torres,et al.  Matching renewable energy supply and demand in green datacenters , 2015, Ad Hoc Networks.

[59]  Abolfazl Toroghi Haghighat,et al.  A stochastic process-based server consolidation approach for dynamic workloads in cloud data centers , 2020, J. Supercomput..