Computer Science ›› 2009, Vol. 36 ›› Issue (9): 24-27.
Previous Articles Next Articles
YAO Lei, DAI Guan-zhong, GHANG Hui-xiang, REN Shuai
Online:
Published:
Abstract: In order to meet user's QoS rectuirement for the implementation of grid workflow, the key tasks of the workflow were analyzed firstly, and the QoS of the whole workflow was divided into segments which are the QoS-constrained of a single task. Then,a grid workflow scheduling algorithm (Q-TWS) based on Two-Way Stratified was proposed.Through both positive layering and reverse layering, this algorithm can find the parallel relation between tasks easily and accurately. Q-TWS can relax the task execution time, increase flexibility scheduling and meet user QoS requiremenu. Simulation results show that Q-TWS has a shorted execution time and a less execution cost compared with BL when the two algorithms have the same deadline.
Key words: Grid computing, Workflow scheduling, QoS-constraincd, Two-way stratified
YAO Lei, DAI Guan-zhong, GHANG Hui-xiang, REN Shuai. QoS-constrained Workflow Scheduling Algorithm for Grid Computing Based on Two-way Stratified[J].Computer Science, 2009, 36(9): 24-27.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2009/V36/I9/24
Cited