Dynamic heuristics for time and cost reduction in grid workflows

Authors:
Yingchun Yuan;XiaoPing Li;Qian Wang
Affiliations:
Sch. of Comp. Sci. and Eng., Southeast Univ., Nanjing, China and Fac. of Inf. Sci., Agriculture Univ. of Hebei, Baoding, Hebei, China and Key Lab. of Comp. Network and Inf. Integration, Ministry o ...;School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China and Key Laboratory of Computer Network and Information Integration, Ministry of Education, Southeast Universit ...;School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China and Key Laboratory of Computer Network and Information Integration, Ministry of Education, Southeast Universit ...
Venue:
CSCWD'06 Proceedings of the 10th international conference on Computer supported cooperative work in design III
Year:
2006

Citing 8
Cited 0

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Condor-G: A Computation Management Agent for Multi-Institutional Grids

Cluster Computing
Scheduling under Uncertainty: Planning for the Ubiquitous Grid

COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
A computational economy for grid computing and its implementation in the Nimrod-G resource broker

Future Generation Computer Systems - Grid computing: Towards a new computing infrastructure
QoS guided min-min heuristic for grid task scheduling

Journal of Computer Science and Technology - Grid computing
Real-Time Strategy and Practice in Service Grid

COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications
Cost-Based Scheduling of Scientific Workflow Application on Utility Grids

E-SCIENCE '05 Proceedings of the First International Conference on e-Science and Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient scheduling methods are essential for time and cost reduction in grid workflow applications, depicted by directed acyclic graphs (DAG). Few of the proposed algorithms consider users' demands when allocating tasks to heterogeneous resources with different capabilities and costs. In this paper, a dynamic time and cost tradeoff heuristic is presented to optimize the cost and time of the whole workflow. The algorithm identifies the time-critical activities and cost-critical activities in each ready list generated during the workflow execution. Appropriate services are allocated to time-critical and cost-critical activities based on different QoS criteria. Experimental results show that the algorithm can achieve a better tradeoff between workflow completion time and execution cost.