Описание тега scheduling
In computer science, scheduling is the method by which threads, processes or data flows are given access to system resource.
Source: " Scheduling (computing)" article on Wikipedia
Types of scheduling
Round-robin
Processes are given a set amount of time. For more information see round-robin
First come first serve
Processes are executed in the order of the queue.
Shortest job first
Processes are executed in order of estimated time.
Shortest remaining time
Similar to shortest job first; however, if a new, shorter process joins the queue, then the scheduler will switch to that one.
Multi-level feedback queue
There is more than just one queue, each queue has a certain priority and the scheduler can move jobs between queues when necessary. Modern operating systems like Windows use this.