Abstract

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.

Highlights

  • When a computer is multiprogrammed, it has several processes competing for the CPU at the same time

  • 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, 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

Read more

Summary

INTRODUCTION

When a computer is multiprogrammed, it has several processes competing for the CPU at the same time. Sceduling algorithm should try to (i)maximize CPU utilization and throughput, (ii)to minimize turnaround time, waiting time and response time and (iii)to avoid starvation of any process (Silberschatz et al, 2008; Andrew and Albert, 2006). Priority: In Priority Scheduling algorithm the process with highest priority is scheduled for execution (Silberschatz et al, 2008; Andrew and Albert, 2006; Stallings, 2008). 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 an algorithm using fuzzy logic has been proposed that tries to remove these two problems

Fuzzy Inference Systems and Fuzzy Logic
Fuzzy Round Robin CPU Scheduling Algorithm
FIS for Finding Time Quantum
FIS for Deciding Preemption
Proposed Fuzzy Round Robin CPU Scheduling Algorithm
Performance
CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.