Path Balance Based Heuristics for Cost Optimization in Workflow Scheduling
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In order to address the trade-off problems between time and cost in the grid workflow scheduling with deadline constraints, this study proposes a new algorithm named path balance (PB) to adjust the length for each path in workflow and develop a heuristic referred as path balance based cost optimization (PBCO). PBCO makes full use of the workflow cost optimization space by setting a deadline for each task, based on the results of PB, and enlarges the optimization space for multitude tasks by distributing the redundancy time, based on the quantities of tasks at each level, this is divided by using the bottom level strategy. According to the experimental results, the average execution cost of PBCO decreases by about 35% relative to other famous heuristics, such as DET and DBL.

    Reference
    Related
    Cited by
Get Citation

刘灿灿,张卫民,骆志刚.基于路径平衡的工作流费用优化方法.软件学报,2013,24(6):1207-1221

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 21,2010
  • Revised:October 17,2011
  • Adopted:
  • Online: June 07,2013
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063