摘要
在网格计算环境中,基于时间限制和费用最小的有向无环图(DAG)调度算法,运用了经济规律把网格用户的任务映射到网格资源中运行。该文综合考虑时间、费用以及任务间的优先关系等诸多QoS需求,提出了基于有向无环图的优化调度算法。通过仿真实例,论证了该算法的优越性。
In the grid computing environment, the time-constrained and minimum-cost optimization dispatch algorithm based on Directed Acyclic Graph (DAG)enabled the grid users'tasks map to the grid resources by using the economic law. With muhiple Qos needs such as the cost-time factor and the priority of tasks had been considered synthetically in this paper, the optimization dispatch algorithm hased on DAG was proposed. A simulative example based on the algorithm is also provided to analyse the characteristics of the algorithm.
出处
《衡阳师范学院学报》
2010年第3期84-87,共4页
Journal of Hengyang Normal University
基金
湖南省教育厅科研资助项目(07C016)
关键词
有向无环图
网格计算
调度算法
directed acyclic graph
grid computing
dispatch algorithm