Learning Based Genetic Algorithm for Task Graph Scheduling
Nowadays, parallel and distributed based environments are used extensively; hence, for using these environments effectively, scheduling techniques are employed. The scheduling algorithm aims to minimize the makespan (i.e., completion time) of a parallel program. Due to the NP-hardness of the schedul...
Saved in:
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2019-01-01
|
Series: | Applied Computational Intelligence and Soft Computing |
Online Access: | http://dx.doi.org/10.1155/2019/6543957 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|