摘要
针对执行时间限制严格类型的DAG类型网格工作流提出一种新的基于资源状态可靠度的网格工作流调度算法。该算法根据用户提交的工作流执行时间要求,利用Chapman-Kolmogorov向后方程来计算出DAG图中关键路径上各资源在任务到达时刻均处于"闲状态"的概率大小,然后选择一组资源组合的状态可靠度大于用户要求的信任度置信水平且总费用较低的一组资源。最后通过实验验证了该算法的有效性。
To the workflow scheduling of DAG-based workflow in which time constraints are rigid,a new algorithm based on the model of resource state reliability is put forward.Aecording to the requirement of the workflow execution time submitted by users, the algorithm caleulates critical paths and obtains the probability for all resources being the idle state at the time when the task arrives by using Chapman-Kolrnogorov backward equations,and then makes the choice of the resource system scheme with the lowest expenditure under the certain credit level of the state reliability for the resource combination on the critical path in DAG. The simulation shows the validity of algorithm.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第18期115-118,共4页
Computer Engineering and Applications
基金
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60563002)
新疆大学青年科研启动基金项目(The Priming Scientific Research Foundation for the Junior Teachers in Xinjiang University)
关键词
网格工作流调度
资源状态可靠度
关键路径
忙状态
闲状态
grid workflow scheduling
resource state reliability
eritical path
busy state
idle state
