IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v30y2022i2d10.1007_s11750-021-00613-1.html
   My bibliography  Save this article

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

Author

Listed:
  • John Martinovic

    (Technische Universität Dresden)

  • Markus Hähnel

    (Technische Universität Dresden)

  • Guntram Scheithauer

    (Technische Universität Dresden)

  • Waltenegus Dargie

    (Technische Universität Dresden)

Abstract

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.

Suggested Citation

  • John Martinovic & Markus Hähnel & Guntram Scheithauer & Waltenegus Dargie, 2022. "An introduction to stochastic bin packing-based server consolidation with conflicts," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 296-331, July.
    • Handle: RePEc:spr:topjnl:v:30:y:2022:i:2:d:10.1007_s11750-021-00613-1
    DOI: 10.1007/s11750-021-00613-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11750-021-00613-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11750-021-00613-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Valerio de Carvalho, J. M., 2002. "LP models for bin packing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 253-273, September.
    2. Belov, G. & Scheithauer, G., 2006. "A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting," European Journal of Operational Research, Elsevier, vol. 171(1), pages 85-106, May.
    3. Oró, Eduard & Depoorter, Victor & Garcia, Albert & Salom, Jaume, 2015. "Energy efficiency and renewable energy integration in data centres. Strategies and modelling review," Renewable and Sustainable Energy Reviews, Elsevier, vol. 42(C), pages 429-445.
    4. Anders S. G. Andrae & Tomas Edler, 2015. "On Global Electricity Usage of Communication Technology: Trends to 2030," Challenges, MDPI, vol. 6(1), pages 1-41, April.
    5. Nicola Jones, 2018. "How to stop data centres from gobbling up the world’s electricity," Nature, Nature, vol. 561(7722), pages 163-166, September.
    6. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    7. John Martinovic & Markus Hähnel & Guntram Scheithauer & Waltenegus Dargie & Andreas Fischer, 2019. "Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation," 4OR, Springer, vol. 17(2), pages 173-200, June.
    8. Clautiaux, François & Hanafi, Saïd & Macedo, Rita & Voge, Marie-Émilie & Alves, Cláudio, 2017. "Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints," European Journal of Operational Research, Elsevier, vol. 258(2), pages 467-477.
    9. Guntram Scheithauer, 2018. "One-Dimensional Cutting Stock," International Series in Operations Research & Management Science, in: Introduction to Cutting and Packing Optimization, chapter 0, pages 73-122, Springer.
    10. John Martinovic & Markus Hähnel & Waltenegus Dargie & Guntram Scheithauer, 2020. "A Stochastic Bin Packing Approach for Server Consolidation with Conflicts," Operations Research Proceedings, in: Janis S. Neufeld & Udo Buscher & Rainer Lasch & Dominik Möst & Jörn Schönberger (ed.), Operations Research Proceedings 2019, pages 159-165, Springer.
    11. Martinovic, J. & Scheithauer, G. & Valério de Carvalho, J.M., 2018. "A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 458-471.
    12. Maxime C. Cohen & Philipp W. Keller & Vahab Mirrokni & Morteza Zadimoghaddam, 2019. "Overcommitment in Cloud Services: Bin Packing with Chance Constraints," Management Science, INFORMS, vol. 65(7), pages 3255-3271, July.
    13. Guntram Scheithauer, 2018. "Introduction to Cutting and Packing Optimization," International Series in Operations Research and Management Science, Springer, number 978-3-319-64403-5, March.
    14. Fredrick S. Hillier, 1967. "Chance-Constrained Programming with 0-1 or Bounded Continuous Decision Variables," Management Science, INFORMS, vol. 14(1), pages 34-57, September.
    15. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    16. L. V. Kantorovich, 1960. "Mathematical Methods of Organizing and Planning Production," Management Science, INFORMS, vol. 6(4), pages 366-422, July.
    17. Harald Dyckhoff, 1981. "A New Linear Programming Approach to the Cutting Stock Problem," Operations Research, INFORMS, vol. 29(6), pages 1092-1104, December.
    18. Fabio Furini & Emiliano Traversi, 2019. "Theoretical and computational study of several linearisation techniques for binary quadratic problems," Annals of Operations Research, Springer, vol. 279(1), pages 387-411, August.
    19. Maxence Delorme & Manuel Iori, 2020. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 101-119, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. John Martinovic, 2022. "A note on the integrality gap of cutting and skiving stock instances," 4OR, Springer, vol. 20(1), pages 85-104, March.
    2. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    3. Maxence Delorme & Manuel Iori, 2020. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 101-119, January.
    4. John Martinovic & Markus Hähnel & Guntram Scheithauer & Waltenegus Dargie & Andreas Fischer, 2019. "Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation," 4OR, Springer, vol. 17(2), pages 173-200, June.
    5. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    6. John Martinovic & Guntram Scheithauer, 2018. "Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case," Annals of Operations Research, Springer, vol. 271(2), pages 811-829, December.
    7. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    8. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
    9. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    10. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    11. Artur Pessoa & Ruslan Sadykov & Eduardo Uchoa, 2021. "Solving Bin Packing Problems Using VRPSolver Models," SN Operations Research Forum, Springer, vol. 2(2), pages 1-25, June.
    12. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    13. Sierra-Paradinas, María & Soto-Sánchez, Óscar & Alonso-Ayuso, Antonio & Martín-Campo, F. Javier & Gallego, Micael, 2021. "An exact model for a slitting problem in the steel industry," European Journal of Operational Research, Elsevier, vol. 295(1), pages 336-347.
    14. Wang, Danni & Xiao, Fan & Zhou, Lei & Liang, Zhe, 2020. "Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation," European Journal of Operational Research, Elsevier, vol. 286(2), pages 547-563.
    15. Katrin Heßler & Stefan Irnich & Tobias Kreiter & Ulrich Pferschy, 2020. "Lexicographic Bin-Packing Optimization for Loading Trucks in a Direct-Shipping System," Working Papers 2009, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    16. Mateus Martin & Horacio Hideki Yanasse & Luiz Leduíno Salles-Neto, 2022. "Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 557-582, August.
    17. Hadj Salem, Khadija & Silva, Elsa & Oliveira, José Fernando & Carravilla, Maria Antónia, 2023. "Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry," European Journal of Operational Research, Elsevier, vol. 306(2), pages 549-566.
    18. Martinovic, J. & Strasdat, N. & Valério de Carvalho, J. & Furini, F., 2023. "A combinatorial flow-based formulation for temporal bin packing problems," European Journal of Operational Research, Elsevier, vol. 307(2), pages 554-574.
    19. Martinovic, J. & Scheithauer, G. & Valério de Carvalho, J.M., 2018. "A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 458-471.
    20. Keehoon Kwon & Doyeong Kim & Sunkuk Kim, 2021. "Cutting Waste Minimization of Rebar for Sustainable Structural Work: A Systematic Literature Review," Sustainability, MDPI, vol. 13(11), pages 1-21, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:30:y:2022:i:2:d:10.1007_s11750-021-00613-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.