Skip to main content
Log in

Efficient multi-attribute precedence-based task scheduling for edge computing in geo-distributed cloud environment

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

In order to realize globalization of cloud computing, joint use of different services of different cloud providers has become an inevitable trend. The geo-distributed cloud consists of several different clouds, providing a general environment for cloud computing. In data placement, many recently proposed data placement algorithms unilaterally use a single performance index to evaluate the performance of the algorithm. In task scheduling, when tasks are allocated with excess cloud resources, resources are wasted. When little cloud resources are allocated to the complex task, cause the overall progress of the system to stagnate, the overall progress of the system is stalled. For solving the above problems, the data placement method and the task scheduling method are proposed. In the proposed data placement scheme, multiple performance indicators are considered. The detection of the straggling nodes and the reasonable allocation of cloud resources are taken into account when the task is scheduled. For proving the superiority of the proposed methods, extensive experiments are conducted. In terms of the data placement, when the number of files is set as 800, the safety level of the proposed data placement algorithm is 7.0, which is 27.3% higher than that of the IDP algorithm, 45.8% higher than that of the GA-DPSO algorithm and 16.7% higher than that of the H2DP algorithm. As for the task scheduling, the percentage improvement in the time overhead of the proposed task scheduling method is the lowest, which implies that the time overhead of the proposed task scheduling algorithm is closest to the optimal time and is the shortest.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  1. Qi L, Chen Y, Yuan Y et al (2020) A QoS-aware virtual machine scheduling method for energy conservation in cloud-based cyber-physical systems. World Wide Web 23(2):1275–1297

    Article  Google Scholar 

  2. Li C, Song M, Zhang M et al (2020) Effective replica management for improving reliability and availability in edge-cloud computing environment. J Parallel Distrib Comput 143:107–128

    Article  Google Scholar 

  3. Gai K, Qiu L, Chen M et al (2017) SA-EAST: security-aware efficient data transmission for ITS in mobile heterogeneous cloud computing. ACM Trans Embed Comput Syst (TECS) 16(2):1–22

    Article  Google Scholar 

  4. Liu K, Peng J, Wang J et al (2020) Scalable and adaptive data replica placement for geo-distributed cloud storages. IEEE Trans Parallel Distrib Syst 31(7):1575–1587

    Article  Google Scholar 

  5. Tang Z, Zhang X, Li K et al (2018) An intermediate data placement algorithm for load balancing in spark computing environment. Future Gener Comput Syst 78:287–301

    Article  Google Scholar 

  6. Shabeera TP, Kumar SDM, Salam SM et al (2017) Optimizing VM allocation and data placement for data-intensive applications in cloud using ACO metaheuristic algorithm. Eng Sci Technol Int J 20(2):616–628

    Google Scholar 

  7. Lin B, Zhu F, Zhang J et al (2019) A time-driven data placement strategy for a scientific workflow combining edge computing and cloud computing. IEEE Trans Ind Inform 15(7):4254–4265

    Article  Google Scholar 

  8. Luo J, Song W, Yin L (2018) Reliable virtual machine placement based on multi-objective optimization with traffic-aware algorithm in industrial cloud. IEEE Access 6:23043–23052

    Article  Google Scholar 

  9. Yu B, Pan J (2017) A framework of hypergraph-based data placement among geo-distributed datacenters. IEEE Trans Serv Comput 13(3):395–409

    Article  MathSciNet  Google Scholar 

  10. Xu X, Fu S, Qi L et al (2018) An IoT-oriented data placement method with privacy preservation in cloud environment. J Netw Comput Appl 124:148–157

    Article  Google Scholar 

  11. Kang S, Veeravalli B, Aung KMM (2016) A security-aware data placement mechanism for big data cloud storage systems. In: 2016 IEEE 2nd international conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing (HPSC), and IEEE International Conference on Intelligent Data and Security (IDS). IEEE, pp 327–-332

  12. Kale RV, Veeravalli B, Wang X (2020) A practicable machine learning solution for security-cognizant data placement on cloud platform. In: Gupta BB, Perez GM, Agrawal DP, Gupta D (eds) Handbook of computer networks and cyber security. Springer, Cham, pp 111–131

    Chapter  Google Scholar 

  13. Kumar AMS, Venkatesan M (2019) Task scheduling in a cloud computing environment using HGPSO algorithm. Cluster Comput 22(1):2179–2185

    Article  Google Scholar 

  14. Dubey K, Kumar M, Sharma SC (2018) Modified HEFT algorithm for task scheduling in cloud environment. Procedia Comput Sci 125:725–732

    Article  Google Scholar 

  15. Jana B, Chakraborty M, Mandal T (2019) A task scheduling technique based on particle swarm optimization algorithm in cloud environment. In: Soft computing: theories and applications. Springer, Singapore, pp 525–536

  16. Panda SK, Nanda SS, Bhoi SK (2018) A pair-based task scheduling algorithm for cloud computing environment. J King Saud Univ Comput Inf Sci. https://doi.org/10.1016/j.jksuci.2018.10.001

    Article  Google Scholar 

  17. Sreenu K, Sreelatha M (2019) W-Scheduler: whale optimization for task scheduling in cloud computing. Cluster Comput 22(1):1087–1098

    Article  Google Scholar 

  18. Hou W, Sun D, Sheng M (2020) QoS dynamic perception scheduling strategy for edge intelligent computing. J Phys Conf Ser 1544:20–22

    Google Scholar 

  19. Wei Y, Pan L, Liu S, Wu L, Meng X (2018) DRL-scheduling: an intelligent QoS-aware job scheduling framework for applications in clouds. IEEE Access 6:55112–55125

    Article  Google Scholar 

  20. Akbari M, Rashidi H, Alizadeh SH (2017) An enhanced genetic algorithm with new operators for task scheduling in heterogeneous computing systems. Eng Appl Artif Intell 61:35–46

    Article  Google Scholar 

  21. AlEbrahim S, Ahmad I (2017) Task scheduling for heterogeneous computing systems. J Supercomput 73(6):2313–2338

    Article  Google Scholar 

  22. Zhou Z, Li F, Zhu H et al (2020) An improved genetic algorithm using greedy strategy toward task scheduling optimization in cloud environments. Neural Comput Appl 32(6):1531–1541

    Article  Google Scholar 

  23. Stavrinides GL, Karatza HD (2019) An energy-efficient, QoS-aware and cost-effective scheduling approach for real-time workflow applications in cloud computing systems utilizing DVFS and approximate computations. Future Gener Comput Syst 96:216–226

    Article  Google Scholar 

  24. Arabnejad H, Barbosa JG (2017) Multi-QoS constrained and Profit-aware scheduling approach for concurrent workflows on heterogeneous systems. Future Gener Comput Syst 68:211–221

    Article  Google Scholar 

  25. Li C, Song M, Yu C, Luo YL (2021) Mobility and marginal gain based content caching and placement for cooperative edge-cloud computing. Inf Sci 548:153–176

    Article  Google Scholar 

  26. Li C, Bai J, Yi C et al (2020) Resource and replica management strategy for optimizing financial cost and user experience in edge cloud computing system. Inf Sci 516:33–55

    Article  MathSciNet  Google Scholar 

  27. Ali HGEDH, Saroit IA, Kotb AM (2017) Grouped tasks scheduling algorithm based on QoS in cloud computing network. Egypt Inform J 18(1):11–19

    Article  Google Scholar 

  28. Mu Y, Liu X, Wang L (2018) A Pearson’s correlation coefficient based decision tree and its parallel implementation. Inf Sci 435:40–58

    Article  MathSciNet  Google Scholar 

  29. Ventrella AV, Piro G, Grieco LA (2018) On modeling shortest path length distribution in scale-free network topologies. IEEE Syst J 12(4):3869–3872

    Article  Google Scholar 

  30. Deb K, Pratap A, Agarwal S et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182–197

    Article  Google Scholar 

  31. Bao C, Xu L, Goodman ED et al (2017) A novel non-dominated sorting algorithm for evolutionary multi-objective optimization. J Comput Sci 23:31–43

    Article  MathSciNet  Google Scholar 

  32. Jiang X, Gripon V, Berrou C et al (2015) Storing sequences in binary tournament-based neural networks. IEEE Trans Neural Netw Learn Syst 27(5):913–925

    Article  MathSciNet  Google Scholar 

  33. Yan Q, Wigger M, Yang S et al (2019) A fundamental storage-communication tradeoff in distributed computing with straggling nodes. In: 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, pp 2803–2807

  34. Wang H, Fu Y, Huang M et al (2017) A NSGA-II based memetic algorithm for multiobjective parallel flowshop scheduling problem. Comput Ind Eng 113:185–194

    Article  Google Scholar 

  35. Hazarika AV, Ram GJSR, Jain E (2017) Performance comparison of Hadoop and spark engine. In: 2017 international conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC). IEEE, pp 671–674

  36. Khalajzadeh H, Yuan D, Grundy J et al (2016) Improving cloud-based online social network data placement and replication. In: 2016 IEEE 9th International Conference on Cloud Computing (CLOUD). IEEE, pp 678–685

  37. Khalajzadeh H, Yuan D, Zhou BB et al (2020) Cost effective dynamic data placement for efficient access of social networks. J Parallel Distrib Comput 141:82–98

    Article  Google Scholar 

  38. Zhang L, Li X, Khalajzadeh H et al (2018) Cost-effective and traffic-optimal data placement strategy for cloud-based online social networks. In: 2018 IEEE 22nd international conference on Computer Supported Cooperative Work in Design (CSCWD). IEEE, pp 110–115

  39. Online SNAP Datasets [2018-10-23]. http://snap.stanford.edu/data/index.html

  40. Hu Z, Li B, Luo J (2017) Time-and cost-efficient task scheduling across geo-distributed data centers. IEEE Trans Parallel Distrib Syst 29(3):705–718

    Article  Google Scholar 

  41. Leskovec J, Lang KJ, Dasgupta A et al (2009) Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29–123

    Article  MathSciNet  Google Scholar 

  42. Online IBM ILOG CPLEX Optimizer. [2018-10-24]. https://www.googl/jyvDuV

  43. Online PUMA Datasets. [2018-10-24]. https://engineering.purdue.edu/~puma/datasets.htm

  44. Guo P, Xue Z (2017) QoS-aware fault-tolerant rate-monotonic first-fit scheduling in real-time systems. In: 2017 IEEE 2nd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC). IEEE, pp 311–315

  45. Panda SK, Pande SK, Das S (2018) Task partitioning scheduling algorithms for heterogeneous multi-cloud environment. Arab J Sci Eng 43(2):913–933

    Article  Google Scholar 

  46. He S, Li Z, Zhou J et al (2019) A holistic heterogeneity-aware data placement scheme for hybrid parallel I/O systems. IEEE Trans Parallel Distrib Syst 31(4):830–842

    Article  Google Scholar 

  47. Vinay K, Kumar SMD (2017) Fault-tolerant scheduling for scientific workflows in cloud environments. In: 2017 IEEE 7th International Advance Computing Conference (IACC). IEEE, pp 150–155

  48. Soniya J, Sujana JAJ, Revathi T (2016) Dynamic fault tolerant scheduling mechanism for real time tasks in cloud computing. In: 2016 international conference on electrical, electronics, and optimization techniques (ICEEOT). IEEE, pp 124–129

Download references

Acknowledgements

The work was supported by the National Natural Science Foundation (NSF) under grants (Nos. 62171330, 61873341), Key Research and Development Plan of Hubei Province (No. 2020BAB102), Opening Project of Key Laboratory of Hydraulic and Waterway Engineering of the Ministry of Education (SLK2021A01) and the Open Project of Wuhan University of Technology Chongqing Research Institute (ZL2021-4). Any opinions, findings and conclusions are those of the authors and do not necessarily reflect the views of the above agencies.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chunlin Li.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, C., Zhang, C., Ma, B. et al. Efficient multi-attribute precedence-based task scheduling for edge computing in geo-distributed cloud environment. Knowl Inf Syst 64, 175–205 (2022). https://doi.org/10.1007/s10115-021-01627-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-021-01627-8

Keywords

Navigation