A Novel Genetic Algorithm Based Scheduling for Multi-core Systems

Scheduling in a multi-core system is a crucial and commonly known as NP-complete problem. In this paper, we have addressed the scheduling problem by a genetic algorithm. Our proposed work considers three contradicting objectives like minimization makespan, maximization of multi-core utilization, and maximization of speedup ratio. We have analyzed and evaluated the proposed work by extensive simulation runs based on synthetic as well as benchmark data set. The result shows considerable improvements over the \(\textit{GAHDCS}\), \(\textit{HGAAP}\), and \(\textit{PGA}\)