Processor scheduling

Scheduler type
Max time slice
Speed
Spawns
MLFQ cycle limits

First come first served
Round robin
Shortest remaining time
Shortest job first
Multilevel feedback queues
First come first served First come first served is a simple scheduler, where any new tasks are placed at the end of the queue, and the CPU works through the queued tasks in order. This is simple, so very little CPU time is used in scheduling the tasks, maximising the time it can use to complete the tasks.