Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A Novel Approach to Cost-Efficient Scheduling of Multi-workflows in the Edge Computing Environment with the Proximity Constraint

  • Conference paper
  • First Online:
Algorithms and Architectures for Parallel Processing (ICA3PP 2019)

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

Abstract

The edge computing paradigm is featured by the ability to offload computing tasks from mobile devices to edge clouds and provide high cost-efficient computing resources, storage and network services closer to the edge. A key question for workflow scheduling in the edge computing environment is how to reduce the monetary cost while fulfilling Service-Level-Agreement in terms of performance and quality-of-service requirements. However, it’s still a challenge to guarantee user-perceived quality of service of applications deployed upon edge infrastructures due to the fact that such applications are constantly subject to negative impacts, e.g., network congestions, unexpected long message delays, shrinking coverage range of edge servers due to battery depletion. In this paper, we study the multi-workflow scheduling problem and propose a novel approach to Cost-Efficient Scheduling of Multi-Workflows in the Edge Computing Environment With Proximity Constraint. The proposed approach aims at minimizing edge computing costs while meeting user-specified workflow completion deadlines and leverages a discrete firefly algorithm for yielding the scheduling plan. We conduct experimental case studies based on multiple well-known scientific workflow templates and a real-world dataset of edge resource locations as well. Experimental results clearly suggest that our proposed approach outperforms traditional ones in terms of cost and makespan.

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 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

Similar content being viewed by others

References

  1. Adhikari, M., Amgoth, T.: An intelligent water drops-based workflow scheduling for IaaS cloud. Appl. Soft Comput. 77, 547–566 (2019)

    Article  Google Scholar 

  2. Habak, K., Ammar, M., Harras, K.A., Zegura, E.: Femtoclouds: leveraging mobile devices to provide cloud service at the edge. In: IEEE International Conference on Cloud Computing (2015)

    Google Scholar 

  3. Hoffa, C., et al.: On the use of cloud computing for scientific workflows. In: Fourth International Conference on e-Science, e-Science 2008, Indianapolis, IN, USA, 7–12 December 2008, pp. 640–645 (2008)

    Google Scholar 

  4. Juve, G., Chervenak, A., Deelman, E., Bharathi, S., Mehta, G., Vahi, K.: Characterizing and profiling scientific workflows. Future Gener. Comput. Syst. 29(3), 682–692 (2013)

    Article  Google Scholar 

  5. Juve, G., Deelman, E., Berriman, G.B., Berman, B.P., Maechling, P.: An evaluation of the cost and performance of scientific workflows on Amazon EC2. J. Grid Comput. 10(1), 5–21 (2012)

    Article  Google Scholar 

  6. Lai, P., et al.: Optimal edge user allocation in edge computing with variable sized vector bin packing. In: Pahl, C., Vukovic, M., Yin, J., Yu, Q. (eds.) ICSOC 2018. LNCS, vol. 11236, pp. 230–245. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-03596-9_15

    Chapter  Google Scholar 

  7. Li, S., Huang, J.: GSPN-based reliability-aware performance evaluation of IoT services. In: 2017 IEEE International Conference on Services Computing, SCC 2017, Honolulu, HI, USA, 25–30 June 2017, pp. 483–486 (2017)

    Google Scholar 

  8. Li, X., et al.: Quality-aware service selection for multi-tenant service oriented systems based on combinatorial auction. IEEE Access 7, 35645–35660 (2019)

    Article  Google Scholar 

  9. Liang, T., Yong, L., Wei, G.: A hierarchical edge cloud architecture for mobile computing. In: IEEE Infocom -the IEEE International Conference on Computer Communications (2016)

    Google Scholar 

  10. Liu, Y., He, Q., Zheng, D., Zhang, M., Chen, F., Zhang, B.: Data caching optimization in the edge computing environment. In: 2019 IEEE International Conference on Web Services, ICWS 2019, Milan, Italy, 8–13 July 2019, pp. 99–106 (2019)

    Google Scholar 

  11. Lunardi, W.T., Voos, H.: An extended flexible job shop scheduling problem with parallel operations. ACM SIGAPP Appl. Comput. Rev. 18(2), 46–56 (2018)

    Article  Google Scholar 

  12. Lyu, X., et al.: Optimal schedule of mobile edge computing for internet of things using partial information. IEEE J. Sel. Areas Commun. 35(11), 2606–2615 (2017)

    Article  Google Scholar 

  13. Mao, Y., Zhang, J., Letaief, K.B.: Dynamic computation offloading for mobile-edge computing with energy harvesting devices. IEEE J. Sel. Areas Commun. 34(12), 3590–3605 (2016)

    Article  Google Scholar 

  14. Mao, Y., Zhang, J., Song, S.H., Letaief, K.B.: Stochastic joint radio and computational resource management for multi-user mobile-edge computing systems. IEEE Trans. Wireless Commun. 16(9), 5994–6009 (2017)

    Article  Google Scholar 

  15. Marichelvam, M.K., Prabaharan, T., Yang, X.: A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems. IEEE Trans. Evol. Comput. 18(2), 301–305 (2014)

    Article  Google Scholar 

  16. Peng, Q., Jiang, H., Chen, M., Liang, J., Xia, Y.: Reliability-aware and deadline-constrained workflow scheduling in mobile edge computing. In: 2019 IEEE 16th International Conference on Networking, Sensing and Control (ICNSC), pp. 236–241. IEEE (2019)

    Google Scholar 

  17. Peng, Q., et al.: Mobility-aware and migration-enabled online edge user allocation in mobile edge computing. In: 2019 IEEE International Conference on Web Services, ICWS 2019, Milan, Italy, 8–13 July 2019, pp. 91–98 (2019)

    Google Scholar 

  18. Sahni, J., Vidyarthi, D.: A cost-effective deadline-constrained dynamic scheduling algorithm for scientific workflows in a cloud environment. IEEE Trans. Cloud Comput. 6(1), 2–18 (2018)

    Article  Google Scholar 

  19. Sanaei, P., Akbari, R., Zeighami, V., Shams, S.: Using firefly algorithm to solve resource constrained project scheduling problem. In: Bansal, J., Singh, P., Deep, K., Pant, M., Nagar, A. (eds.) BIC-TA 2012. AISC, vol. 201, pp. 417–428. Springer, New Delhi (2013)

    Google Scholar 

  20. Shi, W., Jie, C., Quan, Z., Li, Y., Xu, L.: Edge computing: vision and challenges. IEEE Internet of Things J. 3(5), 637–646 (2016)

    Article  Google Scholar 

  21. Tabak, E.K., Cambazoglu, B.B., Aykanat, C.: Improving the performance of independent task assignment heuristics minmin, maxmin and sufferage. IEEE Trans. Parallel Distrib. Syst. 25(5), 1244–1256 (2014)

    Article  Google Scholar 

  22. Wu, H., Deng, S., Li, W., Fu, M., Yin, J., Zomaya, A.Y.: Service selection for composition in mobile edge computing systems. In: 2018 IEEE International Conference on Web Services, ICWS 2018, San Francisco, CA, USA, 2–7 July 2018, pp. 355–358 (2018)

    Google Scholar 

  23. Yang, X.S.: Firefly algorithms for multimodal optimization. Mathematics 5792, 169–178 (2009)

    MathSciNet  MATH  Google Scholar 

  24. Yang, X.S.: Firefly algorithm, stochastic test functions and design optimisation. Int. J. Bio-Inspired Comput. 2(2), 78–84 (2010)

    Article  Google Scholar 

  25. Zhang, Y., Chen, X., Chen, Y., Li, Z., Huang, J.: Cost efficient scheduling for delay-sensitive tasks in edge computing system. In: 2018 IEEE International Conference on Services Computing, SCC 2018, San Francisco, CA, USA, 2–7 July 2018, pp. 73–80 (2018)

    Google Scholar 

  26. Zhao, T., Sheng, Z., Guo, X., Niu, Z.: Tasks scheduling and resource allocation in heterogeneous cloud for delay-bounded mobile edge computing. In: IEEE International Conference on Communications (2017)

    Google Scholar 

Download references

Acknowledgment

This work is in part supported by Fundamental Research Funds for the Central Universities under project Nos. 106112014CDJZR185503 and CDJZR12180012; Science foundation of Chongqing Nos. cstc2014jcyjA40010 and cstc2014jcyjA90027; Chongqing Social Undertakings and Livelihood Security Science and Technology Innovation Project Special Program No. cstc2016shms-zx90002; China Postdoctoral Science Foundation No. 2015M570770; Chongqing Postdoctoral Science special Foundation No. Xm2015078; Universities Sci-tech Achievements Transformation Project of Chongqing No. KJZH17104.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Yunni Xia or Wanbo Zheng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ma, Y. et al. (2020). A Novel Approach to Cost-Efficient Scheduling of Multi-workflows in the Edge Computing Environment with the Proximity Constraint. In: Wen, S., Zomaya, A., Yang, L. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2019. Lecture Notes in Computer Science(), vol 11944. Springer, Cham. https://doi.org/10.1007/978-3-030-38991-8_43

Download citation

Publish with us

Policies and ethics