[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

New Decrease-and-Conquer Strategies for the Dynamic Genetic Algorithm for Server Consolidation

  • Conference paper
  • First Online:
Neural Information Processing (ICONIP 2017)

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

Included in the following conference series:

Abstract

The energy consumption in a data center is a big issue as it is responsible for about half of the operational cost of the data centres. Thus, it is desirable to reduce the energy consumption in data centre. One of the most effective ways of cutting the energy consumption in a data centre is through server consolidation, which can be modelled as a virtual machine placement problem. Since virtual machines in a data centre may come and go at any time, the virtual machine placement problem is a dynamic one. As a result, a decrease-and-conquer dynamic genetic algorithm has been proposed for the dynamic virtual machine placement problem. The decrease-and-conquer strategy plays a very important role in the dynamic genetic algorithm as it directly affects the performance of the dynamic genetic algorithm. In this paper we propose three new decrease-and-conquer strategies and conduct an empirical study of the three new decrease-and-conquer strategies as well as the existing one being used in the decrease-and-conquer genetic algorithm. Through the empirical study we find one of the decrease-and-conquer strategy, namely new first-fit decreasing, is significantly better than the existing decrease-and-conquer strategy.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 71.50
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 89.99
Price includes VAT (United Kingdom)
  • 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

Similar content being viewed by others

References

  1. Dong, J., Jin, X., Wang, H., Li, Y., Zhang, P., Cheng, S.: Energy-saving virtual machine placement in cloud data centers. In: 2013 13th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), pp. 618–624, May 2013

    Google Scholar 

  2. Sarker, T.K., Tang, M.: Performance-driven live migration of multiple virtual machines in datacenters. In: IEEE International Conference on Granular Computing, pp. 253–258 (2013)

    Google Scholar 

  3. Sonklin, C., Tang, M., Tian, Y.C.: A decrease-and-conquer genetic algorithm for energy efficient virtual machine placement in data centers. In: IEEE International Conference on Industrial Informatics. IEEE Press, July 2017, in press

    Google Scholar 

  4. Tang, M., Pan, S.: A hybrid genetic algorithm for the energy-efficient virtual machine placement problem in data centers. Neural Process. Lett. 41(2), 211–221 (2015)

    Article  Google Scholar 

  5. Whitney, J., Delforge, P.: Data center efficiency assessment-scaling up energy efficiency across the data center industry: evaluating key drivers and barriers. NRDC and Anthesis, Rep. IP: 14–08 (2014)

    Google Scholar 

  6. Wu, G., Tang, M., Tian, Y.-C., Li, W.: Energy-efficient virtual machine placement in data centers by genetic algorithm. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds.) ICONIP 2012. LNCS, vol. 7665, pp. 315–323. Springer, Heidelberg (2012). doi:10.1007/978-3-642-34487-9_39

    Chapter  Google Scholar 

  7. Wu, Y., Tang, M., Fraser, W.: A simulated annealing algorithm for energy efficient virtual machine placement. In: 2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 1245–1250, October 2012

    Google Scholar 

  8. Xu, J., Fortes, J.A.B.: Multi-objective virtual machine placement in virtualized data center environments. In: Green Computing and Communications (GreenCom), 2010 IEEE/ACM International Conference on International Conference on Cyber, Physical and Social Computing (CPSCom), pp. 179–188, December 2010

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maolin Tang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Sonklin, C., Tang, M., Tian, YC. (2017). New Decrease-and-Conquer Strategies for the Dynamic Genetic Algorithm for Server Consolidation. In: Liu, D., Xie, S., Li, Y., Zhao, D., El-Alfy, ES. (eds) Neural Information Processing. ICONIP 2017. Lecture Notes in Computer Science(), vol 10637. Springer, Cham. https://doi.org/10.1007/978-3-319-70093-9_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-70093-9_53

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-70092-2

  • Online ISBN: 978-3-319-70093-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics