FUZZY ROUND ROBIN CPU SCHEDULING ALGORITHM
DOI : 10.3844/jcssp.2013.1079.1085
Journal of Computer Science
Volume 9, Issue 8
One problem in Round Robin CPU Scheduling is that if the time required for the running process is slightly more than time quantum even by a fraction value, then process gets preempted and context switch occurs. This causes more waiting time for that process and more overheads due to unnecessary context switch. Another problem with RR scheduling is the value of time Quantum. If it is too large, RR algorithm degenerate to FCFS and if it is too short frequent context switches occurs which results into more overheads which in turn degrade the performance. In this work a Fuzzy Round Robin scheduling algorithm has been proposed that tries to remove these two problems using fuzzy technique. Simulation has been done to compare the performance of this algorithm with its non fuzzy counterpart.
© 2013 Bashir Alam. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.