GENETIC SCHEDULING OF TASK GRAPHS

被引：13

作者：

BENTEN, MST

SAIT, SM

机构：

[1] Department of Computer Engineering, King Fahd University of Petroleum and Minerals, Dhahran

来源：

INTERNATIONAL JOURNAL OF ELECTRONICS | 1994年 / 77卷 / 04期

关键词：

D O I：

10.1080/00207219408926072

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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.

引用

页码：401 / 415

页数：15

共 25 条

[1] COMPARISON OF LIST SCHEDULES FOR PARALLEL PROCESSING SYSTEMS [J].