answersLogoWhite

0

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.

User Avatar

Wiki User

8y ago

What else can I help you with?

Related Questions

Round robin scheduling program in java?

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.


Which scheduling policy is suited in time sharing operating system?

Round Robin


What CPU scheduling algorithm is used Windows NT?

Windows XP uses a quantum-based, preemptive priority scheduling algorithm


What do you mean by scheduling algorithm in OS?

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


Which scheduling policy is most suitable for a time shared operating system?

robinhood sorry its--------- round robin


Difference between round robin scheduling and Weighted round robin scheduling?

One is weighted, the other is not. Simple as.


What kind of data structure is required to implement the round robin scheduling policy?

The circular queue data structure is required to implement the round robin scheduling policy. Round robin is similar to FCFS scheduling.


What is the Round Robin algorithm?

It's an algorithm that is used for CPU schedulers.


what are advantages and disadvantages of Round Robin scheduling algorithm?

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.


Which preemptive version is round robin scheduling?

FIFO (first in first out)


Is round robin scheduling preemptive or non primitive?

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.


Which type of scheduling technique being used in windows 7?

Windows 7 uses a round-robin technique scheduling technique.