 | This articleneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Fixed-priority pre-emptive scheduling" – news ·newspapers ·books ·scholar ·JSTOR(December 2024) (Learn how and when to remove this message) |
Fixed-priority preemptive scheduling is ascheduling system commonly used inreal-time systems.[1] With fixed priority preemptive scheduling, the scheduler ensures that at any given time, theprocessor executes the highest prioritytask of all those tasks that are currently ready to execute.
Thepreemptive scheduler has a clock interrupt task that can provide thescheduler with options toswitch after the task has had a given period to execute—thetime slice. This scheduling system has the advantage of making sure no task hogs the processor for any time longer than the time slice. However, this scheduling scheme is vulnerable to process or threadlockout: since priority is given to higher-priority tasks, the lower-priority tasks could wait an indefinite amount of time. One common method of arbitrating this situation is aging, which gradually increments the priority of waiting processes and threads, ensuring that they will all eventually execute. Mostreal-time operating systems (RTOSs) have preemptive schedulers. Also turning off time slicing effectively gives you the non-preemptive RTOS.
Preemptive scheduling is often differentiated withcooperative scheduling, in which a task can run continuously from start to end without being preempted by other tasks. To have a task switch, the task must explicitly call the scheduler. Cooperative scheduling is used in a few RTOS such asSalvo orTinyOS.
 | Thiscomputer science article is astub. You can help Wikipedia byexpanding it. |