Grid workflow scheduling based on task and data locations

Authors:
Yujin Wu;Ning Gu;Yuwei Zong;Zhigang Ding;Shaohua Zhang;Quan Zhang
Affiliations:
Department of Computing and Information Technology, Fudan University, Shanghai, China;Department of Computing and Information Technology, Fudan University, Shanghai, China;Shanghai Development Center of Computer Software Tchnology, Shanghai, China;Shanghai Development Center of Computer Software Tchnology, Shanghai, China;Shanghai Development Center of Computer Software Tchnology, Shanghai, China;Shanghai Development Center of Computer Software Tchnology, Shanghai, China
Venue:
CDVE'05 Proceedings of the Second international conference on Cooperative Design, Visualization, and Engineering
Year:
2005

Citing 2
Cited 0

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
GridFlow: Workflow Management for Grid Computing

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid

Quantified Score

Hi-index	0.00

Visualization

Abstract

Grid workflow systems provide mechanisms to execute complex tasks which consist of related sub tasks. Due to the intensive computing and data transferring in Grid workflows, the locations of tasks and data have great impact to the execution performance of Grid workflows. In this paper, we present a novel approach to search for optimal Grid workflow scheduling effectively. We model workflow execution with fetching input data and running tasks, and present a optimized scheduling searching algorithm based on simulated annealing, which can find neighborhood scheduling fast. The experimental results show that our approach is effective and scalable.