sched: Round robin algorithm

[roemvaar]

While a task can have only a single priority; several tasks may have the same priority. They are scheduled round-robin.

Each time scheduling occurs at a priority, the least recently readied task is scheduled, requiring something like a first-in, first-out queue.

[roemvaar]

• https://elixir.bootlin.com/linux/latest/source/include/linux/sched.h#L748
• https://elixir.bootlin.com/linux/latest/source/arch/arm64/include/asm/thread_info.h#L24

[roemvaar]

[roemvaar]

[roemvaar]

• Real-time round-robin with priorities scheduling algorithm.
• No timeslices.
• Static priorities. This ensures that a real-time process at a given priority always preempts a process at a lower priority.

[roemvaar]