Explore the concept of latency hints for CFS tasks in this 28-minute conference talk by Vincent Guittot at the Linux Plumbers Conference. Delve into the inner workings of the Completely Fair Scheduler (CFS) and understand its goals. Witness a demonstration of latency-sensitive waiting lists and learn about latency propagation. Examine lazy sensitive entities and their impact on task prioritization. Gain insights into the process of assigning values within the CFS framework. Enhance your understanding of Linux kernel scheduling mechanisms and their role in optimizing system performance.
Overview
Syllabus
Intro
About the CFS
Goal
Demonstration
Latency sensitive waiting lists
Latency propagation
Lazy sensitive entities
Task prioritization
Assigning value
Taught by
Linux Plumbers Conference
