If the set time is too short, then too much process switching will take place and the design will become slow. If the set time is too long, then the system may become unresponsive, time wasting and would emulate First Come First Served.
if the time slice is too large the gantt chart will be small
and if the time slice is too small the gantt chart will be large
One is weighted, the other is not. Simple as.
The circular queue data structure is required to implement the round robin scheduling policy. Round robin is similar to FCFS scheduling.
A variant of round robin scheduling is called selfish round robin scheduling. In selfish round robin, there is a maximum limit on the number of processes that can be placed in the round-robin queue (including the process being executed by the CPU). After that maximum is reached, newly entering processes are placed on a holding queue. Processes in the holding queue do not get any time slice of the CPU. When a process in the round-robin queue completes and leaves the system, the oldest process in the holding queue is allowed to enter the round-robin queue
Round robin is the scheduling algorithm that is utilized by the CPU, or central processing unit, during the execution of the process. It is specifically designed for time sharing systems.
FIFO (first in first out)
Round Robin
Windows 7 uses a round-robin technique scheduling technique.
It is the most simple scheduling algorithmn It is easy to implement in software If the processes are of varied length then it becomes slow.
Round robin schedulingPriority schedulingShortest job firstBy Tirok
robinhood sorry its--------- round robin
waiting time =turn around time-burst time
Pure round robin scheduling processes A, then B, then C, then starts at A again. (A, B, C might be tasks in an operating system context, or devices in a master/slave control network, or whatever.) That is, pure round robin scheduling doesn't acknowledge priorities, and does not allow out-of-order processing. Real-life systems typically use a mixture of algorithms that, together, allow for prioritized and out-of-order processing while, on the other hand, trying to prevent starvation of lower priority items.