A scheduling algorithm using sub-deadline for workflow applications under budget and deadline constrained

作者：Sun, Ting^*; Xiao, Chuangbai; Xu, Xiujie

来源：Cluster Computing, 2019, 22(S3): S5987-S5996.

DOI：10.1007/s10586-018-1751-9

• Scheduling
• Sub-deadline
• Quality of service
• Planning success rate
• Workflow application

With the development of the cloud and grid computing, the cloud infrastructures and grids provide a platform for workflow applications. It is very essential to meet the requirements of users and to complete workflow scheduling efficiently. The scheduling of the workflow is limited by quality of service (QoS) parameters. Many scheduling algorithms have been proposed for the execution of workflow applications using QoS parameters. In this study, we improved a scheduling algorithm that considers workflow applications under budget and deadline constraints. This algorithm provided a simple way to deal with the deadline and budget constraints. The algorithm was named BDSD and used to find a scheduling that satisfies of deadline and budget constraints required by a user. The planning success rate (PSR) was utilized to show the effectiveness of the proposed algorithm. For the simulation experiment, random and real workflow applications were exploited. Experimental results showed that compared with other algorithms the algorithm had a higher PSR.

• 出版日期2019-5
• 单位北京工业大学; 山东建筑大学