Windows 7 uses a round-robin technique scheduling technique.
Round Robin
One is weighted, the other is not. Simple as.
robinhood sorry its--------- round robin
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
the total time that staying in the queue that wait for process of each process.
Task scheduling algorithm such as the Round Robin technique allows for optimal one-to-one matching of tasks and resources by assigning each task to a resource in a cyclic manner. This ensures fair utilization of resources and prevents any resource from being overburdened.
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)
Robin follows Batman as he is Batman's sidekick.
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.