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
Exploiting the Knowledge of Task Structure for Distributed Allocation
β Scribed by A.Di Stefano; L.Lo Bello
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 275 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
β¦ Synopsis
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 a way that minimizes the overall response time of the task. We then propose two allocation algorithms which use knowledge of the application graph and measurement of the current system workload in a heuristic formulation and aim to minimize the task's response time. The presented algorithms, differing in the degree of detail with which they evaluate the effect of concurrence between modules allocated on the same host, have been implemented and evaluated in a real heterogeneous distributed system.
π SIMILAR VOLUMES
Our research strategy has been to identify generic tasks--basic combinations of knowledge structures and inference strategies that are powerful for solving certain kinds of problems. Our strategy is best understood by considering the "interaction problem", that representing knowledge for the purpose
## Abstract Drawing from the structural perspective of social capital theory, this research investigates how internal and external advice network structures influence knowledge overlap and variety and, how these knowledge dimensions in turn influence group effectiveness. Findings from two studies o