By Topic

Cost Optimization Method for Workflows with Deadline Constraints in Grids

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)
Yingchun Yuan ; Agric. Univ. of Hebei, Nanjing ; Xiaoping Li ; Qian Wang ; Xia Zhu

Cost optimization for workflow applications with deadline constraints is fundamental and intractable in grids. In this paper, early tree is introduced to find an early feasible schedule for a workflow application. According to the early tree, a cost optimization algorithm is proposed. Taking into account the workflow total float, the workflow deadline is segmented to activity deadlines while keeping precedence constraints. Costs of all activities are locally optimized, so does the workflow cost. Experimental results show that the proposal that this approach can dramatically decrease workflow cost with different deadlines. Moreover, it outperforms other two leveling algorithms in performance on average.

Published in:

Computer Supported Cooperative Work in Design, 2007. CSCWD 2007. 11th International Conference on

Date of Conference:

26-28 April 2007