Enhancement of CPU Scheduling using Genetic Algorithm | ||
| JOURNAL OF THI-QAR SCIENCE | ||
| Article 1, Volume 3, Issue 3, September 2013, Pages 166-172 | ||
| Author | ||
| Khawla Hussein Ali | ||
| Abstract | ||
| 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. | ||
| Keywords | ||
| CPU scheduling algorithms; genetic algorithm | ||
|
Statistics Article View: 122 PDF Download: 78 |
||