A defect in the Linux kernel fair scheduler's tracking of the zero_vruntime counter can cause two actively yielding tasks to leapfrog each other, potentially leading to a scheduling loop that prevents one task from ever receiving CPU time. This miscalculation can result in process starvation or erratic CPU allocation, undermining both performance and reliability. The flaw is a logic error that may lead to numeric overflow within the scheduler's tick handling code, allowing an attacker to force undesirable scheduling behaviour.

All systems running affected versions of the Linux kernel that include the buggy scheduler code are potentially impacted. No explicit version range is supplied, so any kernel build that contains the commit referenced in the description could be vulnerable.

Although no CVSS or EPSS scores are provided, the nature of the bug suggests a high impact with a local attack vector. An adversary would likely need the ability to submit workload or exploit process scheduling—achievable by a local user or a privileged process—to trigger the race condition. The vulnerability is not listed in CISA's KEV catalog, but the lack of published exploitation data does not mitigate its potential severity in heavily loaded or cgroup‑isolated environments.