Task allocation in distributed processing systems
β Scribed by James V. Hansen; William C. Giauque
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 469 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
As complexity and size of projects increase so do the problems associated with the scheduling and management of the design, manufacturing and assembly processes. In the context of large projects the ability to oplimise the scheduling and allocation of these processes can also aid in tendering for co
This paper considers the problem of distributed dynamic task allocation by a set of cooperative agents. The paper describes a rather speciΓΏc situation. However, its methods have wide application and, thus, it can be useful to solve general problems of computer science. One of its main ideas is to co
The aim of this paper is to evaluate the advantages in task allocation that derive from knowledge of the structure of a task, here modeled by an application graph. We will show how the information contained in the application graph can be embedded inside an allocator in order to guide its choices in