GENETIC SCHEDULING OF TASK GRAPHS

GENETIC SCHEDULING OF TASK GRAPHS. INTERNATIONAL JOURNAL OF ELECTRONICS 77 (4): 401-415 OCT 1994.

[img]
Preview
PDF
Genetic_graphs.pdf

Download (2MB) | Preview

Abstract

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.

Item Type: Article
Subjects: Computer
Department: College of Computing and Mathematics > Computer Engineering
Depositing User: AbdulRahman
Date Deposited: 16 Mar 2008 06:03
Last Modified: 01 Nov 2019 13:23
URI: https://eprints.kfupm.edu.sa/id/eprint/423