This paper presents a problem-space genetic algorithm (PSGA)-based technique for efficient matching and scheduling of an application program that can be represented by a directed acyclic graph, onto a mixed-machine distributed heterogeneous computing (DHC) system. PSGA is an evolutionary technique t
Performance study of a dynamic task scheduling for heterogeneous distributed systems
β Scribed by Ilias K. Savvas; M-Tahar Kechadi
- Publisher
- Springer-Verlag
- Year
- 2004
- Tongue
- English
- Weight
- 760 KB
- Volume
- 4
- Category
- Article
- ISSN
- 1109-2858
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
One of the major limitations of distributed memory systems (DMSs) is the high cost for interprocessor communication, which can be minimized by having an efficient task partitioning and scheduling algorithm. It is well known that scheduling the tasks of a directed acyclic graph (DAG) to obtain an opt
An intelligent control architecture for autonomous robot systems must be modular, scaleable, extendible, and adaptable to the available capacity of computer control systems. To support these properties, the concept of an adaptive control structure, ACS, is presented in this paper. Experiments with a
Multi-Agent Intelligent Systems (MAIS) are loosely-coupled network of problem solving systems that, whenever needed, work together with each other to dynamically solve problems that none of the system can individually solve. Among the advantages of the MAIS, when compared to the centralized systems,