Static Multiprocessor Task Graph Scheduling in the Genetic Paradigm: A Comparison of Genotype Representations

1998.

Cited by: 16|Bibtex|Views0
Other Links: academic.microsoft.com

Abstract:

In the NP-hard multiprocessor scheduling problem a set of precedence constrained tasks are allocated onto processors in a processing order in order to minimise the makespan. Many heuristic methods for finding solutions exist, but they are all sub-optimal on general task graphs. To improve these solutions, genetic algorithms have successf...More

Code:

Data:

Your rating :
0

 

Tags
Comments