Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm
- 1 November 1997
- journal article
- research article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 47 (1) , 58-77
- https://doi.org/10.1006/jpdc.1997.1395
Abstract
No abstract availableThis publication has 29 references indexed in Scilit:
- Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Genetic algorithms for robot controlPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multiprocessor scheduling in a genetic paradigmParallel Computing, 1996
- A state-space search approach for parallel processor scheduling problems with arbitrary precedence relationsEuropean Journal of Operational Research, 1994
- Optimal multiprocessor task scheduling using dominance and equivalence relationsComputers & Operations Research, 1994
- ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORSParallel Algorithms and Applications, 1994
- Notes on the simulation of evolutionIEEE Transactions on Neural Networks, 1994
- THE TIME COMPLEXITY OF SCHEDULING INTERVAL ORDERS WITH COMMUNICATION IS POLYNOMIALParallel Processing Letters, 1993
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessorsJournal of Parallel and Distributed Computing, 1992
- A comparison of list schedules for parallel processing systemsCommunications of the ACM, 1974