The things nobody wants to pay for(lwn.net)

    Completely Fair Scheduler (CFS):
        Primary scheduling class for interactive tasks
        Aims for fairness and responsiveness
        Employs a red-black tree (image below) to organize processes based on their virtual runtime (vruntime)
        Processes with lower vruntime are given priority
    Зображення: redblack tree data structureВідкриється в новому вікні
    www.eecs.umich.edu
    redblack tree data structure 

    Per-CPU runqueues:
        Each CPU core maintains its own runqueue
        Stores processes ready to run on that core
        Reduces contention and improves cache locality

    Load balancing:
        Mechanisms to distribute processes across cores for optimal performance
        Triggered when a core becomes idle or imbalanced
        Migrates processes from overloaded cores to underloaded ones

    Process Creation:
        New processes are assigned to a suitable scheduling class (CFS for interactive)
        Added to a runqueue, initially on the core where they were created

    Process Wakeup:
        When a process becomes ready to run:
            Added to the runqueue of the core where it last ran or a suitable core (load balancing)

    Process Selection:
        CFS periodically selects a process from the runqueue
        Chooses the one with the lowest vruntime (most deprived of CPU time)

    Context Switch:
        The scheduler saves the state of the running process
        Restores the state of the selected process to resume execution

    Per-CPU runqueues:
        Minimize cache-line bouncing and inter-core communication
        Improve performance on multi-core systems
    Load balancing:
        Ensures efficient use of all available CPU cores
        Prevents cores from becoming idle while others are overloaded
    Scalability:
        CFS design scales well with increasing core counts
        Maintains fairness and responsiveness in large systems

    Scheduler domains:
        Hierarchical structures for managing CPU resources across multiple cores or NUMA nodes
        Allow for fine-grained control over scheduling policies
    Preemption:
        CFS supports preemption to prevent processes from monopolizing the CPU
        Ensures interactive tasks remain responsive

    Linux kernel version 6 is under development, so specific details may change.
    The scheduler is a complex component with various optimizations and tuning parameters.
    Understanding its behavior requires deeper exploration of the code and experimentation.