摘要： 针对基于时间和预算限制的资源调度算法在调度数据密集型应用程序时存在的问题，提出一种新的基于通信代价的网格资源调度算法，综合考虑用户的时间限制和预算要求，根据用户作业的计算量与通信量选择具有一定计算能力，且通信代价较小的资源节点作为目标节点，通过减少此类程序提交到目标资源节点的通信代价，达到减少整个应用程序完成时间的目的。实验结果表明，该算法能够获得较好的性能。

关键词: 网格, 资源调度, 数据密集型应用程序

Abstract: Aiming at the problems in scheduling the data-intensive application program of Deadline and Budget Constrain(DBC) resource scheduling algorithm, a novel grid resource scheduling algorithm based on communication cost is proposed, which considers the time constrain and budget requirement of users to select resource nodes as target nodes with higher computation capacity and lower communication cost according to the quantity of computation and communication for users’ operating. By reducing this kind of communication cost, the completed time of the whole application program is reduced. Experimental results show this algorithm can obtain better performance.

Key words: grid, resource scheduling, data-intensive application program

中图分类号: 

• TP301.6