位置:成果数据库 > 期刊 > 期刊详情页
网络管理中多agent的半在线调度算法
  • ISSN号:1000-1239
  • 期刊名称:《计算机研究与发展》
  • 时间:0
  • 分类:TP393.07[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]东南大学计算机科学与工程系,南京210096
  • 相关基金:国家自然科学基金项目(90204009);高等学校博士学科点专项科研基金项目(20030286014)This work is supported by the National Natural Science Foundation of China under grants No. 90204009 and the China Specialized Research Fund for the Doctoral Program of Higher Education under grants No. 20030286014. The problem of scheduling tasks among distributed agents in the multi-agent systems has drawn much attention in the recent years. The existing algorithms rarely involve the relationships among tasks, so that considerable network load and waiting time will be incurred when confronted with complicated task systems. Many of the algorithmic scheduling problems that arise in practice are semionline and semi-online algorithm is more adapted to agent based network management task. Making good scheduling decisions requires a careful analysis of tasks needs and the relationships among tasks, so according to the characteristics of agent scheduling and the relationship among network management tasks, a semi-online multi-agent scheduling algorithm based on dependences of sub-tasks is proposed. The theoretic analysis and experimental results reveal that the semi-online scheduling algorithm is better than the existing online scheduling algorithm. The results not only give a new scheduling approach to the agents in network management, but also can serve as a framework for further studies in other types of agent tasks.
中文摘要:

多agent调度算法在基于多agent的网络管理中对任务执行效率起着至关重要的作用.现有的多agent调度算法由于缺乏考虑任务间的依赖关系,使得面对复杂任务系统时会产生大量的网络负载和等待时间,为此,在建立一个适合网络管理任务特点的多agent调度框架的基础上,提出了一种基于任务依赖关系的多agent半在线调度算法.理论分析和测试结果表明,这种半在线调度算法优于已有的全在线调度算法,其性能更接近离线最优调度算法,从而为网络管理任务中多agent的动态调度提供了一种新的途径。

英文摘要:

Agent scheduling algorithm has great influence on the efficiency of executing task in agent based network management. The existing algorithms don't involve the relationship among tasks, so that considerable network load and waiting time will be incurred when confronted with complicated task systems. To solve scheduling problem in network management, a scheduling framework that answers for the characteristic of network management is presented and a semi-online multi-agent scheduling algorithm based on dependences of sub-tasks is proposed. The competitive analysis and proof reveal that the semionline scheduling algorithm is better than the existing full-online scheduling algorithm. The results of the tests of performance and scheduling time of SONL are consistent with the theoretical results. This scheduling algorithm is a new approach for dynamic agents scheduling in network management.

同期刊论文项目
同项目期刊论文
期刊信息
  • 《计算机研究与发展》
  • 中国科技核心期刊
  • 主管单位:中国科学院
  • 主办单位:中国科学院计算技术研究所
  • 主编:徐志伟
  • 地址:北京市科学院南路6号中科院计算所
  • 邮编:100190
  • 邮箱:crad@ict.ac.cn
  • 电话:010-62620696 62600350
  • 国际标准刊号:ISSN:1000-1239
  • 国内统一刊号:ISSN:11-1777/TP
  • 邮发代号:2-654
  • 获奖情况:
  • 2001-2007百种中国杰出学术期刊,2008中国精品科...,中国期刊方阵“双效”期刊
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,荷兰文摘与引文数据库,美国工程索引,日本日本科学技术振兴机构数据库,中国中国科技核心期刊,中国北大核心期刊(2004版),中国北大核心期刊(2008版),中国北大核心期刊(2011版),中国北大核心期刊(2014版),中国北大核心期刊(2000版)
  • 被引量:40349