By Topic

Cost-Effective Heuristics for Grid Workflow Scheduling Based on Segment Leveling

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
$33 $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

3 Author(s)
Hao Long ; Sch. of Comput. Sci., Beijing Univ. of Technol., Beijing, China ; Di Rui-Hua ; Huang Ming-He

Grid technology is popular in science and business computing environment, with workflow the flexibility and applicability of the grid system can be greatly enhanced. Cost-effective scheduling of grid workflow applications represented by DAG (directed acyclic graph)is an essential and complex problem. In general such problem is NP-hard. In this paper, a novel heuristics, DSL (deadline segment leveling) is proposed. Considering its parallel and synchronization properties, the grid workflow application is divided into segments, and each segment is partitioned into groups further using a segment leveling method. The floating time is prorated to each group to enlarge group duration. In term of control dependencies between tasks, time interval for each task is determined. Experimental results shows DSL can achieve considerable performance improvement than MCP (minimal critical path) and other leveling-based heuristics.

Published in:

Information Engineering, 2009. ICIE '09. WASE International Conference on  (Volume:1 )

Date of Conference:

10-11 July 2009