Scheduling Introduction Task scheduling is the assignment of starting and ending times to a set of tasks, subject to certain constraints.
Constraints are typically either time constraints or resource constraints.
Wind task scheduling uses a priority based preemptive scheduling algorithm as default, but it can also accommodate round-robin scheduling. Description Preemptive Priority Based Scheduling With a preemptive priority based scheduler, each task has a priority and the kernel insures that the CPU is allocated to the highest priority task that is ready to run. This scheduling method is preemptive in that if a task that has a higher priority than the current task becomes ready to run, the kernel immediately saves the current tasks's context and switches to the context of the higher priority task. The Note the priority of a task is relative to the priorities of other tasks. In other words, the task priority number itself has no particular significance by itself.