IKCEST

Concurrency and Computation: Practice and Experience | Vol.29, Issue.4 | | Pages

Scheduling of directed acyclic graphs by a genetic algorithm with a repairing mechanism

Konstantin Sobolev Adil Amirjanov

Abstract

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.

Original Text (This is the original text for your reference.)

Scheduling of directed acyclic graphs by a genetic algorithm with a repairing mechanism

+More

Keywords

scheduling methods computational cost genetic algorithm ga approach penalty method solution quality local repairing mechanism multiprocessor

Cite this article

APA

MLA

Chicago

Konstantin Sobolev,Adil Amirjanov,.Scheduling of directed acyclic graphs by a genetic algorithm with a repairing mechanism. 29 (4),.

Disclaimer: The translated content is provided by third-party translation service providers, and IKCEST shall not assume any responsibility for the accuracy and legality of the content.