Skip to main content
SpringerLink
Log in

Efficient Bin Packing Algorithms for Resource Provisioning in the Cloud

  • Conference paper
  • First Online:
Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9511))

Included in the following conference series:

Abstract

We consider the Infrastructure as a Service (IaaS) model for cloud service providers. This model can be abstracted as a form of online bin packing problem where bins represent physical machines and items represent virtual machines with dynamic load. The input to the problem is a sequence of operations each involving an insertion, deletion or updating the size of an item. The goal is to use live migration to achieve packings with a small number of active bins. Reducing the number of bins is critical for green computing and saving on energy costs. We introduce an algorithm, named HarmonicMix, that supports all operations and moves at most ten items per operation. The algorithm achieves a competitive ratio of 4/3, implying that the number of active bins at any stage of the algorithm is at most 4/3 times more than any offline algorithm that uses infinite migration. This is an improvement over a recent result of Song et al. [12] who introduced an algorithm, named VISBP, with a competitive ratio of 3/2. Our experiments indicate a considerable advantage for HarmonicMix over VISBP with respect to average-case performance. HarmonicMix is simple and runs as fast as classic bin packing algorithms such as Best Fit and First Fit; this makes the algorithm suitable for practical purposes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Throughout the paper, by competitive ratio, we mean asymptotic competitive ratio. For results related to the absolute competitive ratio of bin packing algorithms, we refer the reader to [4, 5].

References

  1. Balogh, J., Békési, J., Galambos, G.: New lower bounds for certain classes of bin packing algorithms. Theor. Comput. Sci. 440–441, 1–13 (2012)

    Article  Google Scholar 

  2. Bentley, J.L., Johnson, D.S., Leighton, F.T., McGeoch, C.C., McGeoch, L.A.: Some unexpected expected behavior results for bin packing. In: Proceedings of 16th Symposium on Theory of Computing (STOC), pp. 279–288 (1984)

    Google Scholar 

  3. Clark, C., Fraser, K., Hand, S., Hansen, J.G., Jul, E., Limpach, C., Pratt, I., Warfield, A.: Live migration of virtual machines. In: 2nd Symposium on Networked Systems Design and Implementation (NSDI) (2005)

    Google Scholar 

  4. Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Approximation Algorithms for NP-hard Problems. PWS Publishing Co (1997)

    Google Scholar 

  5. Coffman Jr., E.G., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Pardalos, P.M., Du, D.Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 455–531. Springer, New York (2013)

    Chapter  Google Scholar 

  6. Gambosi, G., Postiglione, A., Talamo, M.: Algorithms for the relaxed online bin-packing model. SIAM J. Comput. 30(5), 1532–1551 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Johnson, D.S.: Near-optimal bin packing algorithms. Ph.D. thesis, MIT (1973)

    Google Scholar 

  8. Lee, C.C., Lee, D.T.: A simple online bin packing algorithm. J. ACM 32, 562–572 (1985)

    Article  MATH  Google Scholar 

  9. Lee, C.C., Lee, D.T.: Robust online bin packing algorithms. Technical report 83–03-FC-02, Department of Electrical Engineering and Computer Science, Northwestern University (1987)

    Google Scholar 

  10. Meisner, D., Gold, B.T., Wenisch, T.F.: Powernap: eliminating server idle power. In: Proceedings of the 14th International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 205–216 (2009)

    Google Scholar 

  11. Singh, A., Korupolu, M.R., Mohapatra, D.: Server-storage virtualization: integration and load balancing in data centers. In: Proceedings of the ACM/IEEE Conference on High Performance Computing, pp. 53 (2008)

    Google Scholar 

  12. Song, W., Xiao, Z., Chen, Q., Luo, H.: Adaptive resource provisioning for the cloud using online bin packing. IEEE Trans. Comput. 63(11), 2647–2660 (2014)

    Article  MathSciNet  Google Scholar 

  13. Wood, T., Shenoy, P.J., Venkataramani, A., Yousif, M.S.: Sandpiper: black-box and gray-box resource management for virtual machines. Comput. Networks 53(17), 2923–2938 (2009)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Massachusetts Institute of Technology, Cambridge, MA, 02139, USA

    Shahin Kamali

Authors
  1. Shahin Kamali
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shahin Kamali .

Editor information

Editors and Affiliations

  1. Dept of Informatics, Ionian Univ, Kerkyra, Greece

    Ioannis Karydis

  2. Ionian University, Corfu, Greece

    Spyros Sioutas

  3. University of Glasgow, Glasgow, United Kingdom

    Peter Triantafillou

  4. Ionian University, Kerkyra, Greece

    Dimitrios Tsoumakos

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Kamali, S. (2016). Efficient Bin Packing Algorithms for Resource Provisioning in the Cloud. In: Karydis, I., Sioutas, S., Triantafillou, P., Tsoumakos, D. (eds) Algorithmic Aspects of Cloud Computing. ALGOCLOUD 2015. Lecture Notes in Computer Science(), vol 9511. Springer, Cham. https://doi.org/10.1007/978-3-319-29919-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-29919-8_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29918-1

  • Online ISBN: 978-3-319-29919-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation