Yes, it is one of many scheduling algorithms suitable for time sharing.
However it is not suitable for scheduling in a hard realtime OS that must consistently meet deadlines.
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.
Round Robin
Windows XP uses a quantum-based, preemptive priority scheduling algorithm
its the algorithm that tells the os what to process next.goes according to :shortest job firstshortest remaining time firstround robin- first in first out system
robinhood sorry its--------- round robin
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.
It's an algorithm that is used for CPU schedulers.
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.
FIFO (first in first out)
If a process does not complete before its CPU-time expires, the CPU is preempted and given to the next process waiting in a queue. The preempted process is then placed at the back of the ready list. Round Robin Scheduling is preemptive (at the end of time-slice) therefore it is effective in time-sharing environments in which the system needs to guarantee reasonable response times for interactive users.
Windows 7 uses a round-robin technique scheduling technique.