Efficient CPU Scheduling: A Genetic Algorithm based Approach
S. M. Kamalapur, Neeta Deshpande
Abstract
S. M. Kamalapur, Neeta Deshpande
Abstract
Operating system's performance and throughput are highly affected by CPU scheduling. The scheduling is considered as an NP problem. An efficient scheduling improves system performance. This paper presents and evaluates a method for process scheduling. In this paper, we will discuss the use of genetic algorithms to provide efficient process scheduling. We will evaluate the performance and efficiency of the proposed algorithm in comparison with other deterministic algorithms by simulation. The results shows that proposed GA-based algorithm gives better performance measure. This paper attempts to present evaluation of proposed GA based scheduling against existing traditional algorithms.
OpenAlex reports 7 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.
Operating system's performance and throughput are highly affected by CPU scheduling. The scheduling is considered as an NP problem. An efficient scheduling improves system performance. This paper presents and evaluates a method for process scheduling. In this paper, we will discuss the use of genetic algorithms to provide efficient process scheduling. We will evaluate the performance and efficiency of the proposed algorithm in comparison with other deterministic algorithms by simulation. The results shows that proposed GA-based algorithm gives better performance measure. This paper attempts to present evaluation of proposed GA based scheduling against existing traditional algorithms.
Key concepts: Computer science, Fair-share scheduling, Rate-monotonic scheduling, Dynamic priority scheduling, Two-level scheduling, Round-robin scheduling, Genetic algorithm scheduling, Earliest deadline first scheduling