摘要
由于现有算法在网格环境下不能很好地解决资源有偿服务和满足用户的QoS需求间的问题,该文通过综合考虑作业中任务之间的优先关系,给出费用-时间优化的i-DAG调度算法,在保证作业时间期限的条件下,利用所求的最大路径,最大程度上将任务集中映射并映射到较便宜的资源上,减少了作业的计算开销和通信开销。实验仿真证明了算法的优越性。
In the current grid environment, the existing schedule algorithm can not solve the issues of paying for using the resources and satisfying the QOS need of the customer. Considering priority in subtasks of the job, an cost-time optimization i-DAG schedule algorithm is presented, which can solve the existing issues well. The sets of the maximum path are gained from the algorithm, with the restriction of job running time, the subtasks are concentrative mapped into cheap resources so that the algorithm can save computing cost and communications cost of the job. A simulative example based on the algorithm is also provided to prove that the algorithm has good characteristics.
出处
《计算机工程》
CAS
CSCD
北大核心
2007年第24期37-40,共4页
Computer Engineering
基金
国家"973"计划基金资助项目(TG1999035801)
国家自然科学基金资助项目(6053012)
关键词
网格计算
资源调度
最大路径
grid computing
resource schedule
maximum path
