Nothing Special   »   [go: up one dir, main page]

Skip to main content

An Efficient Framework for Resource Allocation and Dynamic Pricing Scheme for Completion Time Failure in Cloud Computing

  • Conference paper
  • First Online:
Advances in Networked-Based Information Systems (NBiS 2021)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 313))

Included in the following conference series:

Abstract

Cloud computing, as an infrastructure less service, has gained a lot of attention over a decade now. The surge for the resource allocation and pricing have been at the centre stage of the research for a while in cloud computing. In this paper, we have proposed an efficient resource allocation and dynamic pricing algorithm for completion time failure in cloud computing (RADPACTF). Theoretical analysis is also provided in support of the proposed algorithm.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.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
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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

Similar content being viewed by others

References

  1. Babaioff, M., et al.: ERA: a framework for economic resource allocation for the cloud. In: Proceedings of the 26th International Conference on World Wide Web Companion, WWW 2017 Companion, pp. 635–642. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE (2017)

    Google Scholar 

  2. Pahl, C., Brogi, A., Soldani, J., Jamshidi, P.: Cloud container technologies: a state-of-the-art review. IEEE Trans. Cloud Comput. 7, 677–692 (2019)

    Article  Google Scholar 

  3. Park, J., Kim, D., Yeom, K.: An approach for reconstructing applications to develop container-based microservices. Mob. Inf. Syst. 2020, 1–23 (2020). Article id: 4295937

    Google Scholar 

  4. Ferguson, A.D., Bodik, P., Kandula, S., Boutin, E., Fonseca, R.: Jockey: guaranteed job latency in data parallel clusters. In: Proceedings of the 7th ACM European Conference on Computer Systems, EuroSys 2012, pp. 99–112. ACM, New York (2012)

    Google Scholar 

  5. Tumanov, A., Zhu, T., Park, J.W., Kozuch, M.A., Harchol-Balter, M., Ganger, G.R.: TetriSched: global rescheduling with adaptive plan-ahead in dynamic heterogeneous clusters. In: Proceedings of the 11th European Conference on Computer Systems, EuroSys 2016. ACM, New York (2016)

    Google Scholar 

  6. Griebler, D., Vogel, A., De Sensi, D., Danelutto, M., Fernandes, L.G.: Simplifying and implementing service level objectives for stream parallelism. J. Supercomput. 76, 4603–4628 (2020)

    Article  Google Scholar 

  7. Rasley, J., Karanasos, K., Kandula, S., Fonseca, R., Vojnovic, M., Rao, S.: Efficient queue management for cluster scheduling. In: Proceedings of the 11th European Conference on Computer Systems, EuroSys 2016. ACM, New York (2016)

    Google Scholar 

  8. Ousterhout, K., Wendell, P., Zaharia, M., Stoica, I.: Sparrow: scalable scheduling for sub-second parallel jobs. Technical Report No. UCB/EECS-2013-29, EECS Department, University of California, Berkeley (2013)

    Google Scholar 

  9. Grandl, R., Ananthanarayanan, G., Kandula, S., Rao, S., Akella, A.: Multi-resource packing for cluster schedulers. SIGCOMM Comput. Commun. Rev. 44, 455–466 (2014)

    Article  Google Scholar 

  10. Verma, A., Pedrosa, L., Korupolu, M., Oppenheimer, D., Tune, E., Wilkes, J.: Large-scale cluster management at Google with Borg. In: Proceedings of the 10th European Conference on Computer Systems, EuroSys 2015. ACM, New York (2015)

    Google Scholar 

  11. Hindman, B., et al.: Mesos: a platform for fine-grained resource sharing in the data center. In: NSDI 11, pp. 295–308 (2011)

    Google Scholar 

  12. Sarkar, D.: Introducing HDInsight. In: Pro Microsoft HDInsight. Apress, Berkeley (2014). https://doi.org/10.1007/978-1-4302-6056-1_1

  13. Lee, I.: Pricing schemes and profit-maximizing pricing for cloud services. J. Revenue Pricing Manage. 18, 112–122 (2019)

    Article  Google Scholar 

  14. Chun, S.-H.: Cloud services and pricing strategies for sustainable business models: analytical and numerical approaches. Sustainability 12, 49 (2020)

    Article  Google Scholar 

  15. Bhan, R., Singh, A., Pamula, R., Faruki, P.: Auction based scheme for resource allotment in cloud computing. In: Patnaik, S., Yang, X.-S., Tavana, M., Popentiu-Vlădicescu, F., Qiao, F. (eds.) Digital Business. LNDECT, vol. 21, pp. 119–141. Springer, Cham (2019). https://doi.org/10.1007/978-3-319-93940-7_5

    Chapter  Google Scholar 

  16. Ni, T., Chen, Z., Chen, L., Zhong, H., Zhang, S., Xu, Y.: Differentially private combinatorial cloud auction. arXiv preprint arXiv:2001.00694 (2020)

  17. Boutin, E., et al.: Apollo: scalable and coordinated scheduling for cloud-scale computing. In: Proceedings of the 11th USENIX Conference on Operating Systems Design and Implementation, OSDI 2014, pp. 285–300. USENIX Association, USA (2014)

    Google Scholar 

  18. Mazrekaj, A., Shabani, I., Sejdiu, B.: Pricing schemes in cloud computing: an overview. Int. J. Adv. Comput. Sci. Appl. 7 (2016)

    Google Scholar 

  19. Dimitri, N.: Pricing cloud IaaS computing services. J. Cloud Comput. 9, 14 (2020). https://doi.org/10.1186/s13677-020-00161-2

    Article  Google Scholar 

  20. Song, Y., Zafer, M., Lee, K.-W.: Optimal bidding in spot instance market. In: Proceedings of the IEEE INFOCOM 2012, pp. 190–198 (2012)

    Google Scholar 

Download references

Acknowledgements

This work is supported by the Visvesvaraya Ph.D. scheme, sponsored by MeitY Govt. of India with grant number [PhD-MLA/4(29)/2014-15].

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Sajal Mukhopadhyay , Ujjwal Rai or Arghya Bandyopadhyay .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bandyopadhyay, A., Singh, V.K., Mukhopadhyay, S., Rai, U., Bandyopadhyay, A. (2022). An Efficient Framework for Resource Allocation and Dynamic Pricing Scheme for Completion Time Failure in Cloud Computing. In: Barolli, L., Chen, HC., Enokido, T. (eds) Advances in Networked-Based Information Systems. NBiS 2021. Lecture Notes in Networks and Systems, vol 313. Springer, Cham. https://doi.org/10.1007/978-3-030-84913-9_13

Download citation

Publish with us

Policies and ethics