Cloud workflow scheduling algorithm based on novelty ranking and multi-quality of service

被引:0
|
作者
Yuan Y.-W. [1 ,2 ]
Yu J. [1 ,2 ]
Zheng H.-S. [1 ]
Wang J.-J. [1 ]
机构
[1] School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou
[2] Key Laboratory of Complex Systems Modeling and Simulation, Ministry of Education, Hangzhou
关键词
Cloud workflow; Novelty ranking; Quality of service(QoS); Recommendation system; Scheduling; Simulated annealing algorithm;
D O I
10.3785/j.issn.1008-973X.2017.06.017
中图分类号
学科分类号
摘要
A cloud service workflow scheduling algorithm based on novelty ranking and multiple quality of service (QoS) was proposed, aiming at the problem that the optimal scheduling based on user cost and system utilization was not considered in the existing researches. Frequency of the tasks performed by the resource node, waiting time and execution time of the resource node were added into the recommendation model. The simulated annealing algorithm was used to train the recommendation model, and the priority factor was calculated. The scheduler performed the scheduling and updated it according to the priority factor table. Simulation results show that the proposed algorithm is better than the Q-learning algorithm in terms of task execution time, and the combined index of user cost and system utilization is better than that of the Q-learning algorithm on CloudSim platform. © 2017, Zhejiang University Press. All right reserved.
引用
下载
收藏
页码:1190 / 1196
页数:6
相关论文
共 18 条
  • [1] Zheng M., Cao J., Yao Y., Cloud workflow scheduling algorithm oriented to dynamic price changes, Computer Integrated Manufacturing Systems, 19, 8, pp. 1849-1858, (2013)
  • [2] Lee Y.C., Han H., Zomaya A.Y., Et al., Resource-efficient workflow scheduling in clouds, Knowledge-Based Systems, 80, 8, pp. 153-162, (2015)
  • [3] Huang T.-T., Liang Y.-W., An improved simulated annealing genetic algorithm for workflow scheduling in cloud platform, Microelectronics and Computer, 33, 1, pp. 42-46, (2016)
  • [4] Casas I., Taheri J., Ranjan R., Et al., A balanced scheduler with data reuse and replication for scientific workflows in cloud computing systems, Future Generation Computer Systems, (2016)
  • [5] Starlinger J., Cohen-Boulakia S., Khanna S., Et al., Effective and efficient similarity search in scientific workflow repositories, Future Generation Computer Systems, 56, 3, pp. 584-594, (2016)
  • [6] Wang Y., Huang K., Wang F., Scheduling online mixed-parallel workflows of rigid tasks in heterogeneous multi-cluster environments, Future Generation Computer Systems, 60, 7, pp. 35-47, (2016)
  • [7] Kianpisheh S., Charkari N.M., Kargahi M., Reliability-driven scheduling of time/cost-constrained grid workflows, Future Generation Computer Systems, 55, 2, pp. 1-16, (2016)
  • [8] Liu J.-X., Yang X.-F., Ye X., Cloud workflow scheduling method based on batch processing strategy, Computer Integrated Manufacturing Systems, 21, 2, pp. 336-343, (2015)
  • [9] Wen Y.-P., Liu J.-X., Chen C.-Y., Privacy-aware and cost-aware workflow scheduling in clouds, Computer Integrated Manufacturing Systems, 22, 2, pp. 294-301, (2016)
  • [10] Poola D., Ramamohanarao K., Buyya R., Fault-tolerant workflow scheduling using spot instances on clouds, Procedia Computer Science, 29, 3, pp. 523-533, (2014)