Open Source Summit Korea 2026

In modern cloud environments, CPU usage often looks healthy while applications still experience latency and unpredictable slowdowns. In one Kubernetes based system running latency sensitive workloads, services degraded despite CPU staying below 50%. Traditional monitoring showed no clear issue, leading to delayed debugging and reactive fixes.

This case study highlights how the real bottleneck was hidden in the Linux scheduler specifically run queue contention and scheduling delays. By examining run queue depth and task scheduling behavior, the team uncovered how fairness-driven scheduling (CFS) impacted performance under load. The session also touches on how newer approaches like EEVDF aim to improve scheduling decisions.

The result was faster root cause identification, better workload tuning, and improved application responsiveness without scaling resources.

Key Takeaways:

- Why CPU utilization can mislead performance analysis
- How run queue depth and scheduling latency impact applications
- The gap between fair scheduling and real-world performance
- What’s changing in modern schedulers (CFS > EEVDF)
- Practical ways to reason about scheduler related bottlenecks