Abstract
As an emerging business computing model, cloud computing needs to deal with the scientific workflow submitted by user groups. How to efficiently schedule massive tasks of scientific workflow is an important problem in cloud computing. In order to minimize the total execution time of workflow, reduce the consume of cloud resources, reduce execution costs of users, a new task scheduling algorithm based on task duplication and task grouping is proposed in this paper. The new algorithm is composed of four steps. Firstly, the join nodes are duplicated, a DAG is converted into an in-tree graph, then all tasks are divide into task groups, it reduces communication overhead between tasks; then some task groups are merged by utilizing the idle time between tasks in a task group, it reduces the use of the processors; lastly, Assign the tasks to processors by making full use of the idle time of the processors, it increases resource utilization. The new algorithm is compared with TDS and TDCS by simulation platform CloudSim. The performance indicators for comparison include makespan of workflow, the number of used processors and resource utilization. The experiment results show that the new algorithm has a smaller makespan of workflow, fewer processors are used, and has higher resource utilization for both compute-intensive and data-intensive workflow, especially for data-intensive workflow, the new algorithm has obvious advantages on the three performance indicators.
Similar content being viewed by others
References
Mell, P., Grance, T.: The NIST definition of cloud computing (2011)
Ali, S.A., Alam, M.: A: relative study of task scheduling algorithms in cloud computing environment. In: Proceedings of 2016 2nd International Conference on Contemporary Computing and Informatics (IC3I). IEEE (2016)
DUAN, J., CHEN, W.H., WANG, R.P., YU, M.Y., WANG, S.K.: Execution optimization policy of scientific workflow based on cluster aggregation under cloud environment. J. Comput. Appl. 35(6), 1580–1584 (2015)
Darbha, S., Agrawal, D.P.: Optimal scheduling algorithm for dis-tributed-memory machines. IEEE Trans. Parallel Distrib. Syst. 9(1), 87–95 (1998)
Wang, X.J., Wang, Y., Hao, Z., Du, J.: The research on resource scheduling based on fuzzy clustering in cloud computing. In: Proceedings of 8th International Conference on ICICTA 2015, pp. 1025–1028 (2016)
Sreenu, K., Sreelatha, M.: Whale optimization for task scheduling in cloud computing. Clust. Comput. pp. 1–12 (2017)
Geng, X.Z., Xu, G.C., Fu, X.D., Zhang, Y.: A task scheduling algorithm for multi-core-cluster systems. J. Comput. (Finl.) 7(11), 2797–2804 (2012)
Chien, N.K., Hong, S.N., Ho, D.L.: Load balancing algorithm based on estimating finish time of services in cloud computing. In: Proceedings of International Conference on Advanced Communication Technology, ICACT, pp. 228–232 (2016)
Xu, J., Zhu, J.C., Lu, K.: Task scheduling algorithm based on dual fitness genetic annealing algorithm in cloud computing environment. J. Univ. Electron. Sci. Technol. China 42(6), 900–904 (2013)
Zhang, X.L.: Study on scheduling algotithm of the independend and associated for cloud computing. Chongqing University (2014)
Meng, X.F., Liu, W.W.: A DAG scheduling algorithm based on selected duplication of precedent tasks. J. Comput. Aided Des. Comput. Graph. 22(6), 1056–1062 (2010)
Chen, W.H., Xie, G.Q., Li, R.F., Bai, Y.: Efficient task scheduling for budget constrained parallel applications on heterogeneous cloud computing systems. Futur. Gener. Comput. Syst. 74, 1–11 (2017)
Ding, Y.S., Yao, G.S., Hao, K.R.: Fault-tolerant elastic scheduling algorithm for workflow in cloud systems. Inf. Sci. 393, 47–65 (2017)
Acknowledgements
This research was supported by the Foundation of Jilin Province Education Department ([2015] No. 306).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Geng, X., Mao, Y., Xiong, M. et al. An improved task scheduling algorithm for scientific workflow in cloud computing environment. Cluster Comput 22 (Suppl 3), 7539–7548 (2019). https://doi.org/10.1007/s10586-018-1856-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10586-018-1856-1