Abstract :
CPU scheduler makes a sequence of moves that determines the interleaving of processes to be allocated by a CPU. Programs use synchronization to prevent bad moves, but scheduling choices appear to the program to be non deterministic, the scheduler s moves are dictated by a scheduling policy . Different CPU scheduling algorithms have different properties and may favor one class of processes over another. Many criteria have been suggested for comparison can make a substantial difference in a determination of the best algorithm such as CPU utilization, Throughput, turnaround time, waiting time, response time. Because such a wide variety of scheduling algorithms are available (such as FCFS, SJF, SRT, RR), so we present a genetic algorithm for minimize the turnaround time and comparison with these algorithms, the results are good.
