Genetic scheduling of task graphs
- 1 October 1994
- journal article
- research article
- Published by Taylor & Francis in International Journal of Electronics
- Vol. 77 (4) , 401-415
- https://doi.org/10.1080/00207219408926072
Abstract
A genetic algorithm for scheduling computational task graphs is presented. The problem of assigning tasks to processing elements as a combinatorial optimization is formulated, and a heuristic based on a genetic algorithm is presented. The objective function to be minimized is the ‘time on completion’ of all tasks. Results are compared with those published in the literature and with randomly generated task graphs whose optimal schedules are known a priori.This publication has 14 references indexed in Scilit:
- Architectures for statically scheduled dataflowJournal of Parallel and Distributed Computing, 1990
- Scheduling parallel program tasks onto arbitrary target machinesJournal of Parallel and Distributed Computing, 1990
- Scheduling with sufficient loosely coupled processorsJournal of Parallel and Distributed Computing, 1990
- A genetic approach to standard cell placement using meta-genetic parameter optimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- Scheduling Precedence Graphs in Systems with Interprocessor Communication TimesSIAM Journal on Computing, 1989
- Efficient scheduling algorithms for robot inverse dynamics computation on a multiprocessor systemIEEE Transactions on Systems, Man, and Cybernetics, 1988
- Genetic PlacementIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Performance Guarantees for Scheduling AlgorithmsOperations Research, 1978
- A comparison of list schedules for parallel processing systemsCommunications of the ACM, 1974
- Optimal scheduling for two-processor systemsActa Informatica, 1972