Skip to main content

Multi-choice Virtual Machine Allocation with Time Windows in Cloud Computing

  • Conference paper
  • First Online:
Green, Pervasive, and Cloud Computing (GPC 2018)

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

Included in the following conference series:

  • 670 Accesses

Abstract

Virtual machine allocation is a core problem in cloud computing. Most cloud computing platforms allow users to submit one requirement, which does not satisfy the diversity of user demands and also reduces the incomes of the platform. We propose a novel model, called multi-choice virtual machine allocation (MCVMA) with time windows, where the users can enter and leave the system at any time and submit multiple requirements. We design an optimal algorithm based on dynamic programming and a heuristic algorithm based on the resource scarcity and density for the MCVMA problem with time windows. We experimentally analyze both algorithms in terms of social welfare, execution time, resource utilization and users served.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Amazon: Amazon ec2 instance types. https://amazonaws-china.com/cn/ec2/instance-types/

  2. Angelelli, E., Bianchessi, N., Filippi, C.: Optimal interval scheduling with a resource constraint. Comput. Oper. Res. 51(3), 268–281 (2014)

    Article  MathSciNet  Google Scholar 

  3. Angelelli, E., Filippi, C.: On the complexity of interval scheduling with a resource constraint. Theoret. Comput. Sci. 412(29), 3650–3657 (2011)

    Article  MathSciNet  Google Scholar 

  4. ASCI: Grid workloads archives. http://gwa.ewi.tudelft.nl

  5. Darmann, A., Pferschy, U., Schauer, J.: Resource allocation with time intervals. Theoret. Comput. Sci. 411(49), 4217–4234 (2010)

    Article  MathSciNet  Google Scholar 

  6. Liu, X., Li, W., Zhang, X.: Strategy-proof mechanism for provisioning and allocation virtual machines in heterogeneous clouds. IEEE Trans. Parallel Distrib. Syst. https://doi.org/10.1109/tpds.2017.2785815

  7. Mashayekhy, L., Fisher, N., Grosu, D.: Truthful mechanisms for competitive reward-based scheduling. IEEE Trans. Comput. 65(7), 2299–2312 (2016)

    Article  MathSciNet  Google Scholar 

  8. Mashayekhy, L., Nejad, M.M., Grosu, D.: A PTAS mechanism for provisioning and allocation of heterogeneous cloud resources. IEEE Trans. Parallel Distrib. Syst. 26(9), 2386–2399 (2015)

    Article  Google Scholar 

  9. Nejad, M.M., Mashayekhy, L., Grosu, D.: Truthful greedy mechanisms for dynamic virtual machine provisioning and allocation in clouds. IEEE Trans. Parallel Distrib. Syst. 26(2), 594–603 (2015)

    Article  Google Scholar 

  10. Shi, W., Zhang, L., Wu, C., Li, Z., Lau, F.C.M.: An online auction framework for dynamic resource provisioning in cloud computing. IEEE/ACM Trans. Networking 24(4), 2060–2073 (2016)

    Article  Google Scholar 

  11. Zaman, S., Grosu, D.: Combinatorial auction-based allocation of virtual machine instances in clouds. J. Parallel Distrib. Comput. 73(4), 495–508 (2013)

    Article  Google Scholar 

Download references

Acknowledgments

The authors thank IBM for providing the full version of CPLEX12, which sets no limitations for solving for the optimal solution. This research is supported by the National Natural Science Foundation of China (61472345, 61662088 and 11663007), the Project of Natural Science Foundation of Yunnan Province of China (2014FA023, 2015FB115), and the Scientific Research Foundation of Yunnan Provincial Department of Education (2017ZZX228).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Weidong Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, J., Xie, N., Zhang, X., Li, W. (2019). Multi-choice Virtual Machine Allocation with Time Windows in Cloud Computing. In: Li, S. (eds) Green, Pervasive, and Cloud Computing. GPC 2018. Lecture Notes in Computer Science(), vol 11204. Springer, Cham. https://doi.org/10.1007/978-3-030-15093-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-15093-8_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-15092-1

  • Online ISBN: 978-3-030-15093-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics