same as linux use.
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..
Windows XP uses a quantum-based, preemptive priority 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.
scheduling algorithm
It's an algorithm that is used for CPU schedulers.
By far the simplest CPU-scheduling algorithm is the first-come, first-served (FCFS) scheduling algorithm. With this scheme, the process that requests the CPU first is allocated the CPU first. The implementation of the FCFS policy is easily managed with a FIFO queue. When a process enters the ready queue, its PCB is linked onto the tail of the queue. When the CPU is free, it is allocated to the process at the head of the queue. The running process is then removed from the queue. The code for FCFS scheduling is simple to write and understand. The average waiting time under the FCFS policy, however, is often quite long. Consider the following set of processes that arrive at time 0, with the length of the CPU-burst time given in milliseconds:
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.
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.
The Least Slack Time scheduling algorithm is used for assigning priority based on the slack time (temporal difference between the deadline, ready time and run time) of a process.
Round Robin
Priority based algorithm
The round-robin scheduling algorithm allocates CPU time to processes by sequentially assigning the CPU to processes of equal priority that are in the state of being able to use the CPU. (Not blocked) This works by appearing to evenly distribute the CPU amongst CPU ready processes. Processes that are waiting on something, such as an I/O event, particularly waiting on the user to press Enter, are not considered for allocation. Often, there is a priority assigned to the process, which factors in the allocation strategy. Processes that are mostly I/O intensive tend to have higher priority, giving them good response time. Processes that are mostly CPU intensive tend to have lower priority, so they don't interfere with overall system responsiveness.