Why Linux Process Scheduling Became a CPU Contention Solution

In this episode of The Linux Podcast with Fexingo, Lucas and Luna dive into the evolution of Linux process scheduling—from the O(n) scheduler of the early kernel to the Completely Fair Scheduler (CFS) and its successor, the EEVDF scheduler introduced in Linux 6.6. They explain how the scheduler handles CPU contention in mixed workloads, why latency-sensitive and throughput-heavy processes conflict, and how the new 'sched_ext' framework in Linux 6.12 allows BPF-based scheduling extensions. The episode uses a concrete example: a server running both a real-time audio application and a batch data-crunching job. Listeners will learn about scheduling classes, nice values, cgroups CPU controllers, and the practical implications of choosing between CFS and EEVDF for production workloads. Produced by the Fexingo Business podcast network. #Linux #ProcessScheduling #CFS #EEVDF #SchedExt #Kernel #CPU #BPF #Scheduling #OpenSource #Technology #FexingoBusiness #BusinessPodcast #LinuxPodcast #RealTime #Cgroups #NiceValues #ServerOptimization Keep every episode free: buymeacoffee.com/fexingo