A Dynamic Critical Path Algorithm for Scheduling Scientific Workflow Applications on Global Grids

Authors:
Mustafizur Rahman;Srikumar Venugopal;Rajkumar Buyya
Affiliations:
-;-;-
Venue:
E-SCIENCE '07 Proceedings of the Third IEEE International Conference on e-Science and Grid Computing
Year:
2007

Citing 0
Cited 11

Hybrid Re-scheduling Mechanisms for Workflow Applications on Multi-cluster Grid

CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Simulation-based analysis of performance dynamics of distributed applications in heterogeneous network environments

SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Cooperative and decentralized workflow scheduling in global grids

Future Generation Computer Systems
BTS: Resource capacity estimate for time-targeted science workflows

Journal of Parallel and Distributed Computing
Cost optimized provisioning of elastic resources for application workflows

Future Generation Computer Systems
Optimizing distributed computing workflows in heterogeneous network environments

ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Latency modeling and minimization for large-scale scientific workflows in distributed network environments

Proceedings of the 44th Annual Simulation Symposium
Modeling and simulation of distributed computing workflows in heterogeneous network environments

Simulation
On a multi-objective evolutionary algorithm for optimizing end-to-end performance of scientific workflows in distributed environments

Proceedings of the 45th Annual Simulation Symposium
A Distributed Workflow Management System with Case Study of Real-life Scientific Applications on Grids

Journal of Grid Computing
Impact of variable priced cloud resources on scientific workflow scheduling

Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling algorithm that determines efficient mapping of tasks by calculating the critical path in the workflow task graph at every step. It assigns priority to a task in the critical path which is estimated to complete earlier. Using simulation, we have compared the performance of our proposed approach with other existing heuristic and meta-heuristic based scheduling strategies for different type and size of workflows. Our results demonstrate that DCP based approach can generate better schedule for most of the type of workflows irrespective of their size particularly when resource availability changes frequently.