Cost-effective Heuristics for Workflow Scheduling in Grid Computing Economy

摘要：

The increasing demand for grid computing resources calls for an incentive-compatible pricing mechanism for differentiated service qualities. Costeffective scheduling of grid workflow applications described by Directed Acyclic Graph (DAG) becomes an essential and complex problem. In general, the optimization problem is NP-hard, and heuristics are among the methods of choice. In this paper, in order to taking advantage of the workflow deadline, several priority rules are developed, which take into account both activity information and service levels information. To invalidate their effectiveness, these priority rules are applied to different initial solutions.Computational experiments show that two heuristics combining priority rules GRBPA, GRPA with starting solution HL can achieve the better results than heuristics based on other priority rules.

作者: Yingchun Yuan Xiansong Li Chenxia Sun

作者单位: Faculty of Information Science, Agriculture University of Hebei, Baoding, P.R.China;School of Comput Office of Management and Technology, Agriculture University of Hebei, Baoding, P.R.China Faculty of Information Science, Agriculture University of Hebei, Baoding, P.R.China

会议类型: 国际会议

会议名称: 第六届网格与协同计算国际会议(The Sixth International Conference on Grid and Cooperative Computing GCC 2007)

会议地点: 乌鲁木齐

会议语种:英文

页码: 322-329

在线出版日期: 2007-08-16（万方平台首次上网日期，不代表论文的发表时间）