Benten, M. S. and Sait, Sadiq M. GENETIC SCHEDULING OF TASK GRAPHS. INTERNATIONAL JOURNAL OF ELECTRONICS 77 (4): 401-415 OCT 1994.
A genetic algorithm for scheduling computational task graphs is presented. The problem of assigning tasks to processing elements as a combinatorital 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.
|Divisions:||College Of Computer Sciences and Engineering > Computer Engineering Dept|
|Creators:||Benten, M. S. and Sait, Sadiq M.|
|Deposited On:||16 Mar 2008 09:03|
|Last Modified:||12 Apr 2011 13:07|
Repository Staff Only: item control page