Finding a correct time quantum is a quite difficult task in this system.Lower time quantum results in higher the context switching overhead in the system.
Round-robin scheduling doesn’t give special priority to more important tasks. Priorities cannot be set for the processes. Its performance heavily depends on time quantum. This method spends more time on context switching. If slicing time of OS is low, the processor output will be reduced. Here, are drawbacks/cons of using Round-robin scheduling: It gives the best performance in terms of average response time. Allows OS to use the Context switching method to save states of preempted processes. Once a process is executed for a specific set of the period, the process is preempted, and another process executes for that given time period. That’s why it is easily implementable on the system. This scheduling method does not depend upon burst time. If you know the total number of processes on the run queue, then you can also assume the worst-case response time for the same process. It deals with all process without any priority. All the jobs get a fair allocation of CPU. It doesn’t face the issues of starvation or convoy effect. Here, are pros/benefits of Round-robin scheduling method: Widely used scheduling method in traditional OS. Round robin is one of the oldest, fairest, and easiest algorithm. It is a real time algorithm which responds to the event within a specific time limit. Time slice should be minimum, which is assigned for a specific task that needs to be processed. Round robin is a hybrid model which is clock-driven. The process that is preempted is added to the end of the queue. The CPU is shifted to the next process after fixed interval time, which is called time quantum/time slice. Here are the important characteristics of Round-Robin Scheduling: Disadvantages of Round-robin SchedulingĬharacteristics of Round-Robin Scheduling. Characteristics of Round-Robin Scheduling. In this Operating system tutorial, you will learn: This algorithm also offers starvation free execution of processes. In Round-robin scheduling, each ready task runs turn by turn only in a cyclic queue for a limited time slice. It is the oldest, simplest scheduling algorithm, which is mostly used for multitasking. 
The name of this algorithm comes from the round-robin principle, where each person gets an equal share of something in turns.
0 kommentar(er)
