The O(1) scheduler is based on priority classes

Real-time FIFO threads can be preempted by Real-time round robin threads

A thread making a system call in Linux will block the parent process

In the O(1) scheduler, the next task to run is picked from the Active array

Choosing the next task to run in the CFS scheduler has complexity logarithmic in the number of tasks