CAJ | 학술논문

在网格资源处理速度和资源价格异构的网格环境下,讨论基于用户费用约束的最优时间调度问题,提出一种相应的调度算法,将该任务调度问题转化为线性规划问题,采用单纯形算法获得近似最优解,从而获得费用约束下资源的最优执行时间以及该任务的最小完成时间.仿真结果表明,该算法的性能优于其他同类算法.
재망격자원처리속도화자원개격이구적망격배경하,토론기우용호비용약속적최우시간조도문제,제출일충상응적조도산법,장해임무조도문제전화위선성규화문제,채용단순형산법획득근사최우해,종이획득비용약속하자원적최우집행시간이급해임무적최소완성시간.방진결과표명,해산법적성능우우기타동류산법.
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.