Premium
Scheduling of directed acyclic graphs by a genetic algorithm with a repairing mechanism
Author(s) -
Amirjanov Adil,
Sobolev Konstantin
Publication year - 2016
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.3954
Subject(s) - directed acyclic graph , computer science , scheduling (production processes) , directed graph , algorithm , mechanism (biology) , parallel computing , mathematical optimization , mathematics , philosophy , epistemology
This study has developed a genetic algorithm (GA) approach to the problem of task scheduling for multiprocessor systems. The proposed GA implements the local repairing mechanism and the penalty method, and it does not need tuning of any parameters for high performance. Comparison with other scheduling methods, based on a GA approach, indicates that the proposed GA is competitive in solution quality and also computational cost.