A Genetic Algorithm Approach to CPU Scheduling

Aradhana Dahiya, Shabnam Sangwan


CPU scheduling is a ‘NP-complete’ problem. i.e., algorithms require exponential time to reach a solution. Moreover, it is a critical factor that effect the operating system efficiency in process scheduling we allocate processes to processor in such an order so that throughput and efficiency of the resulting system is maximized. This NP-complete nature of the problem requires innovative solutions for the problem. Genetic algorithms over the years have proved itself for finding innovative solutions for scheduling. In this work we study how genetic algorithm is used to find an innovative solution for CPU Scheduling.

Full Text:


Copyright (c) 2018 Edupedia Publications Pvt Ltd

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.


All published Articles are Open Access at  https://journals.pen2print.org/index.php/ijr/ 

Paper submission: ijr@pen2print.org