> 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.
展开▼
机译： > Round Robin CPU调度中的一个问题是，如果正在运行的进程所需的时间比时间量稍微多一点（甚至小数），那么进程将被抢占并发生上下文切换。由于不必要的上下文切换，这将导致该过程更多的等待时间和更多的开销。 RR调度的另一个问题是时间Quantum的值。如果太大，RR算法会退化为FCFS，如果太短，则会发生频繁的上下文切换，这会导致更多的开销，进而降低性能。在这项工作中，提出了一种模糊循环调度算法，该算法试图使用模糊技术消除这两个问题。通过仿真比较了该算法与非模糊算法的性能。
展开▼
