The main advantage is that they ensure fairness to all jobs, regardless of its priority and also provide quick response time depending on the CPU time the job needs.
The main disadvantage is that it provides indefinite postponement to process.
Preemptive scheduler reruns scheduling decision when process becomes ready. If the new process has priority over running process, the CPU preempts the running process and executes the new process. Non-preemptive scheduler only does scheduling decision when running process voluntarily gives up CPU. In effect, it allows every running process to finish its CPU burst.
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..
scheduling algorithm
i like moldy chess. cheese....shests
muje pta hota tho ish site par kya karti
Windows XP uses a quantum-based, preemptive priority scheduling algorithm
Preemptive scheduler reruns scheduling decision when process becomes ready. If the new process has priority over running process, the CPU preempts the running process and executes the new process. Non-preemptive scheduler only does scheduling decision when running process voluntarily gives up CPU. In effect, it allows every running process to finish its CPU burst.
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..
The main advantage of Bresenham's algorithm is speed. The disadvantage of such a simple algorithm is that it is meant for basic line drawing. The "advanced" topic of antialiasing isn't part of Bresenham's algorithm, so to draw smooth lines, you'd want to look into a different algorithm.
Strictly speaking, nonpreemptive scheduling is when the scheduler does not stop the process from running in order to switch it with a different process, but instead, it lets the process to complete and then schedules a different process depending on the a scheduling algorithm is uses.
Priority based algorithm
scheduling algorithm
i like moldy chess. cheese....shests
same as linux use.
Advantages & disadvantages of LMS algorithm :(1) Simplicity in implementation(2) Stable and robust performance against different signal conditions(3) slow convergence ( due to eigenvalue spread )(4) MSE Behavior of the LMS Algorithm
muje pta hota tho ish site par kya karti
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.