By Topic

An iterative heuristic for scheduling grid workflows with budget constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ying-Chun Yuan ; Fac. of Inf. Sci. & Technol., Agric. Univ. of Hebei, Baoding, China ; Ke-Jian Wang ; Xin-Sheng Sun ; Tao Guo

Workflow scheduling which guarantees anticipated QoS (quality of service) is a complex problem in grids. In this paper, the budget-constrained scheduling of workflows represented by DAG (directed acyclic graph) with the objective of time optimization is considered. A new priority rule-based iterative heuristic is proposed. According to the property of serial activities in DAG, the concept called SC (serial complexity) is defined. By incorporating it into priority rule MP (maximum profit), a novel priority rule, denoted as MPSC (maximum profit with serial complexity), is designed. It is implemented in the iterative heuristic to improve iteratively the initial feasible solution. Computational results show that MPSC can considerably improve the average performance of MP, MPBL and MPTL within a few iterations and a little computation time. As well, the impact of budget constraints on these heuristics is analyzed.

Published in:

Machine Learning and Cybernetics, 2009 International Conference on  (Volume:3 )

Date of Conference:

12-15 July 2009