By Topic

Time-Cost Tradeoff Dynamic Scheduling Algorithm for Workflows 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

3 Author(s)
Yingchun Yuan ; Dept. of Comput. Sci. & Eng., Southeast Univ., Nanjing ; Xiaoping Li ; Qian Wang

Service resources allocation and scheduling is one of the challenging and complex problems in computation-economy-driven open grid service architecture. This paper proposes a time-cost tradeoff workflow scheduling algorithm in which cost is optimized for schedules with the expectation to minimize workflow duration. Dynamic service selection strategy is adopted to adapt to dynamic shared and autonomous resources in grids. Simulation results show that the algorithm can achieve less completion time and lower cost which can meet requirements in practical applications

Published in:

Computer Supported Cooperative Work in Design, 2006. CSCWD '06. 10th International Conference on

Date of Conference:

3-5 May 2006