会议专题

Research on Task Scheduling Based on LDA

To cooperate effectively with its peers in the cooperative system, an Agent must finish its tasks in time.Overload situations of an Agent should be avoided at the beginning of task scheduling. The purpose of this paper is to investigate the mathematical and computational aspects of Agent workload to optimize task scheduling.We begin with definitions of some abstract representations such as workload and atomic activity set. Workload distribution algorithm and task scheduling algorithm are then presented, which are used for the optimization of task allocation. At last, we give some results of a simulation experiment, which shows that the two algorithms can be used in task scheduling optimization.

Agent Task Workload Density Interval LDA Scheduling

Yawei Zhao Quan Yin Haisheng Zhang

Chengdu Institute of Computer Application The Chinese Academy of Sciences Chengdu, 610041, China

国际会议

Proceedings of The Fourth International Conference on Parallel and Distribyted Computing,Applications and Technologies(第四届并行与分布式计算应用与技术国际会议)

成都

英文

557-561

2003-08-27(万方平台首次上网日期,不代表论文的发表时间)