I'm reading OS Concepts for my undergrad OS class and came across this topic: Pthread scheduling (System and Process)
Then I kept reading and came across POSIX Real-Time Scheduling that has two scheduling classes:
SCHED_FIFO: first come first serve
SCHED_RR: round robin
Does this mean scheduling is different for real time computing or are they different levels of thread scheduling regardless of whether it is real time or not?
This is the POSIX API shown for real time scheduling:
pthread attr getschedpolicy(pthread attr t *attr, int *policy) pthread attr setschedpolicy(pthread attr t *attr, int policy)
Edit: I think there is a different Linux real time kernel for which these APIs are applicable: https://www.embedded.com/comparing-real-time-scheduling-on-the-linux-kernel-and-an-rtos/
Can anyone confirm this is the case?