answersLogoWhite

0


Best Answer

FIFO (first in first out)

User Avatar

Wiki User

11y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Which preemptive version is round robin scheduling?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What type of scheduling is there in RTOS?

A scheduler is the heart of every RTOS. It provides the algorithms to select the task for execution. Three common scheduling algorithms are > Cooperative scheduling > Round-robin scheduling > Preemptive scheduling RTOS uses preemptive (priority based) scheduling. In some cases, real-time requirements can be met by using static scheduling.


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.


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 CPU scheduling algorithm is used Windows NT?

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


What is CPU scheduling?

The CPU scheduler is the part of the Operating System that determines when to allow each thread to execute. Usually this is done by seeing if all the wait conditions, such as IO wait, timer wait, semaphore wait, etc. have been cleared, and if the thread priority or round-robin turn criteria have been met.


What is virtual round robin CPU 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 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.


What is preemptive scheduling and non preemptive scheduling?

Tasks are usually assigned with priorities. At times it is necessary to run a certain task that has a higher priority before another task although it is running. Therefore, the running task is interrupted for some time and resumed later when the priority task has finished its execution. This is called preemptive scheduling.Eg: Round robinIn non-preemptive scheduling, a running task is executed till completion. It cannot be interrupted.Eg First In First Out


Which scheduling policy is suited in time sharing operating system?

Round Robin


Which type of scheduling technique being used in windows 7?

Windows 7 uses a round-robin technique scheduling technique.


Advantages of Round Robin Scheduling?

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.