网格计算中费用约束的最优时间调度算法

Budget Constrained Optimal Time Schedule Algorithm in Grid Computing

在网格资源处理速度和资源价格异构的网格环境下,讨论基于用户费用约束的最优时间调度问题,提出一种相应的调度算法,将该任务调度问题转化为线性规划问题,采用单纯形算法获得近似最优解,从而获得费用约束下资源的最优执行时间以及该任务的最小完成时间。仿真结果表明,该算法的性能优于其他同类算法。

In the grid environment where the gird resources have different speeds of computation and prices, optimal time schedule problem based on budget constrain is discussed. A relevant algorithm is proposed. The task schedule problem is converted into a linear programming problem. Each resource gains the optimal execution time and the smallest completion time of the task under the condition of the budget constraint in the use of the simplex algorithm to obtain the approximate optimal solution. Simulation experimental results show the performance of the algorithm is superior to other similar algorithms.