作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (10): 126-128. doi: 10.3969/j.issn.1000-3428.2008.10.045

• 网络与通信 • 上一篇    下一篇

基于多QoS目标的工作流任务调度算法

胡志刚,胡周君   

  1. (中南大学信息科学与工程学院,长沙 410083)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-05-20 发布日期:2008-05-20

Workflow Task Scheduling Algorithm Based on Multi-QoS Objective

HU Zhi-gang, HU Zhou-jun   

  1. (School of Information Science and Engineering, Central South University, Changsha 410083)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-05-20 Published:2008-05-20

摘要: 根据工作流任务的结构特点对其进行分区,按照任务量和通信量将总工作流截止日期和总工作流花费分为每个任务分区上的子截止日期和子花费,在考虑用户多个QoS要求及工作流任务间通信时间的基础上,提出基于信任与花费的综合效益函数,给出信任与花费权值的确定方法以及一个以综合效益最优为目标的调度算法——TCD,算法通过追求局部最优达到全局多目标优化调度。与其他算法的比较表明,该算法服务拒绝率最多可降低15%,能较好地满足用户多QoS要求。

关键词: 工作流, 多QoS, 任务分区, 综合效益函数

Abstract: Workflow tasks are partitioned according to the characteristic of workflow tasks structure, and the whole deadline and cost are divided into sub-deadline and sub-cost in every task partition by task length and traffic between tasks. Based on the users’ multi-QoS requirements and communication time between workflow tasks, this paper presents a trust-and-cost-based comprehensive beneficial function, a strategy of determination of trust’s and cost’s weight, and a scheduling algorithm——TCD which takes trust and cost comprehensive optimization as its objective. The multiple objective optimal scheduling of the whole is reached by pursuing part optimization. Compared with others algorithms through simulation shows that the service refuse rate of the algorithm can reduce by 15% at most and it satisfies users’ multi-QoS well.

Key words: workflow, multi-QoS, task partition, comprehensive beneficial function

中图分类号: