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
Framework for Task Scheduling in Heterogeneous Distributed Computing Using Genetic Algorithms
β Scribed by Andrew J. Page; Thomas J. Naughton
- Publisher
- Springer Netherlands
- Year
- 2005
- Tongue
- English
- Weight
- 107 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0269-2821
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
To exploit a heterogeneous computing (HC) environment, an application task may be decomposed into subtasks that have data dependencies. Subtask matching and scheduling consists of assigning subtasks to machines, ordering subtask execution for each machine, and ordering intermachine data transfers. T
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