An assignment method for IPUs in distributed systems |
| |
Authors: | Liang Li Guowei Yang |
| |
Affiliation: | (1) Computing Center, Chengdu University of Electronic Science and Technology, 610054 Chengdu, P.R. China |
| |
Abstract: | In a distributed system, one of the most important things is to establish an assignment method for distributing tasks. It is assumed that a dis tributed system does not have a central administrator, all independent processing units in this system want to cooperate for the best results, but they cannot know the conditions of one another. So in order to undertake the tasks in admirable pro portions, they have to adjust their undertaking tasks only by self-learning. In this paper, the performance of this system is analyzed by Markov chains, and a robust method of self-learning for independent processing units in this kind of systems is presented. This method can lead the tasks of the system to be distributed very well among all the independent processing units, and can also be used to solve the general assignment problem. |
| |
Keywords: | distributed systems independent processing unit (IPU) assignment problem self-learning optima algorithm |
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录! |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载全文 |
|