Genetic scheduling of task graphs

Muhammad S. Benten, Sadiq M. Sait

International Journal of Electronics · 1994 · 21 citations · 18 references

DOIFull text

Open access

Concepts

Abstract

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.

References

18