Genetic Algorithm approach to Operating system process scheduling problem
Rakesh Kumar, Rajiv Kumar, Er Sanjeev Gill
Abstract
Rakesh Kumar, Rajiv Kumar, Er Sanjeev Gill
Abstract
This paper present the implementation of genetic algorithm for operating system process scheduling. Scheduling in operating systems has a significant role in overall system performance and throughput. An efficient scheduling is vital for system performance. The scheduling is considered as NP hard problem .In this paper , we use the power of genetic algorithm to provide the efficient process scheduling. the aim is to obtain an efficient scheduler to allocate and schedule the process to CPU. we will evaluate the performance and efficiency of the proposed algorithm using simulation results.
OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper present the implementation of genetic algorithm for operating system process scheduling. Scheduling in operating systems has a significant role in overall system performance and throughput. An efficient scheduling is vital for system performance. The scheduling is considered as NP hard problem .In this paper , we use the power of genetic algorithm to provide the efficient process scheduling. the aim is to obtain an efficient scheduler to allocate and schedule the process to CPU. we will evaluate the performance and efficiency of the proposed algorithm using simulation results.
Key concepts: Fair-share scheduling, Rate-monotonic scheduling, Computer science, Two-level scheduling, Round-robin scheduling, Genetic algorithm scheduling, Dynamic priority scheduling, Fixed-priority pre-emptive scheduling