Reliable Scheduling Algorithm for Time-constrained Grid Workflow
Scheduling scientific workflow which can satisfy deadline constraint is a complicated problem because of the dynamicity of Grid resource.Various strategies were proposed,including static heuristic scheduling strategies and reservation strategies.However,the existing scheduling strategies can not provide guarantee for deadline because of lacking efficient evaluation for dynamic service capacity of resource.Birth-death process was utilized to describe the change of numbers of process unit in a resource node.A novel evaluation method of resource capacity based on stochastic service model was proposed in the paper.Then,aimed at workflow scheduling with deadline constraint,a reliability enhanced scheduling algorithm was presented.The results of extensive simulation experiments show that the proposed algorithm outperforms DSESAW and PFAS,with respect to guarantee deadline and adaptability to dynamic Grid environment.