Want this question answered?
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.
Windows XP uses a quantum-based, preemptive priority scheduling algorithm
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)
Windows 7 uses a round-robin technique scheduling technique.
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
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
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.
The size of the Time Quantum
The size of the Time Quantum