0
Round Robin
Wiki User
∙ 11y ago
Add your answer:
Earn +20 pts
What CPU scheduling algorithm is used Windows NT?
Windows XP uses a quantum-based, preemptive priority scheduling algorithm
What is the Round Robin algorithm?
It's an algorithm that is used for CPU schedulers.
What CPU scheduling algorithm is used by?
same as linux use.
What is priority scheduling algorithm?
The priority scheduling algorithm is a kind of CPU scheduling algorithm where the processes that wait for the CPU are scheduled according to their priority..
Is the IMac's CPU good?
It uses an Intel Quad Core i5 or i7 processor. This is an excellent CPU also used on Windows PCs.
What is the difference between primitive and non primitive CPU scheduling algorithm?
In Non-Primitive CPU Algo. once a process is given to the CPU it cannot be preempt,but in primitive Algo. it can be.
What is the best CPU?
my cpu process is dual coreit can support windows 7 home basic ]
How can you get 2 CPU players on Super Smash Bros?
Simply click the other windows to open them a CPU you will appear.
What is the minimum CPU requirement for windows 7?
1 GHz
What is role of reservation station in Tomasulo's Algorithm?
Reservation Stations are decentralized features of the microarchitecture of a CPU that allow for register renaming, and are used by the Tomasulo algorithm for dynamic instruction scheduling.Reservation stations permit the CPU to fetch and re-use a data value as soon as it has been computed, rather than waiting for it to be stored in a register and re-read. When instructions are issued, they can designate the reservation station from which they want their input to read.
Which type of process scheduling does Linux and window uses?
Linux has a number of schedulers available in its kernel, plus at least one scheduler available as a patch. But the default schedler is the Completely Fair Scheduler. Like most modern schedulers, it is pre-emptive, meaning that instead of the process deciding when to give up the CPU, the kernel decides for it when to give up the CPU. This keeps even the most uncooperative process from starving the other processes on the computer of CPU time. From what I understand of how CFS works: It keeps an eye on how much of an assigned quantum (length of time.) is actually spent on the CPU by a process and how much of the quantum is spent blocking (Keeping off the CPU to wait for I/O requests to complete, a process can't usually proceed and keep going without requested data. During the time a process is waiting for the hardware, other processes make use of the CPU.) The less time a process actually uses the CPU on its given quantum, the higher a priority it gets so that when the data from an I/O operation is complete the process can quickly execute to the next I/O request and block again. This keeps the CPU busy, but the system responsive to just about any event.I don't know what sort of process scheduling is used on Windows. Windows, unlike Linux, is given a pretty heavy black box treatment when it comes to its users and a great deal about its kernel is not common knowledge. Presumably it is a pre-emptive, priority-based scheduler. Doubtful it's as efficient as CFS.
What on a computer indentifies the window?
The hard drive has the windows files on it which in turn helps the CPU indentify the windows version.
