BUDGET CONSTRAINED OPTIMAL TIME SCHEDULING ALGORITHM IN GRID

摘要：

Tasks’ smallest completion time is a fundamental goal of the grid scheduling, however, the completion time of tasks and cost are often anticorrelated. In this paper, A Budget Constrained Optimal Time Scheduling on the grid computing platforms is discussed, where resources have different speeds of computation and Prices. The task scheduling problem is converted into a linear programming problem. Each resource gains the optimal execution time and the smallest completion time of the task were obtained, under the condition of the budget constraint, using of the simplex algorithm to obtain the optimal solution. The simulation results show that the performance of the algorithm is superior to other similar algorithms.

关键词： grid scheduling linear programming simplez algorithm

作者: Lv Yi Liu Chuan Huang Sheng Jiang Qing

作者单位: Communication and Information Engineering Institute, Chongqing University of Posts and Telecommunications,Chongqing 400065, China

会议类型: 国际会议

会议名称: 2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology(2009年宽带网络与多媒体国际会议 IEEE IC-BNMT2009)

会议地点: 北京

会议语种:英文

页码: 816-820

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