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. A round-robin scheduling algorithm attempts to share the CPU fairly among all ready tasks of the same priority. Without round-robin scheduling, when multiple tasks of equal priority must share the processor, a single task can usurp the processor by never blocking, thus never giving other equal priority tasks a chance to run. Round-robin scheduling achieves fair allocation of the CPU to tasks of the same priority by an approach known as time slicing . The allocation is fair in that no task of a priority group gets a second slice of time before the other tasks of a group are given a slice.