Open Source Summit North America 2025

The Linux kernel project has been going for well over 30 years. From its beginnings on floppy diskettes and beige boxes through to its current home in pockets and unseen data centers, the kernel project has been a constant exercise in rapid development and adaptation. I have been present for almost all of the kernel project's history as an observer, contributor, maintainer, and more; all that experience will be boiled down into a fast-moving tour of how the kernel got to where it is, what makes it successful, and what may be coming next.

While containers provide isolation for CPU cycles and memory capacity, they offer limited protection against performance interference through shared CPU caches and memory bandwidth. Such contention was shown to increase application response times by 4-13x. The Linux resctrl infrastructure provides monitoring and control mechanisms, but has limitations for controlling real-world applications.

For example, child processes do not inherit their parent's resctrl groups, leaving any application that forks improperly monitored and controlled. Additionally, the current filesystem-based interface makes it difficult to build a controller that can monitor and adjust quickly enough to keep up with frequently changing application memory behavior.

This talk introduces the memory interference problem and presents new kernel mechanisms to address these limitations. A new collector enables effective control by capturing per-container measurements of cache and memory bandwidth usage at millisecond frequencies. We'll cover how the solution combines Intel RDT, AMD QoS, high-resolution timers, perf counters, and cgroups to achieve this. We'll discuss future work and opportunities for collaboration.

The vmalloc mechanism in the Linux kernel provides contiguous virtual memory allocations, even when the underlying physical memory is non-contiguous. However, with increasing adoption and usage, the synchronization of vmalloc data structures poses significant performance challenges, particularly in many-core systems with 256+ cores.

This session will explore the scalability improvements made to the vmalloc mechanism, covering the following key topics:

1. An overview of the legacy vmalloc approach, which relies on a single global lock for data synchronization.

2. Introduction to an enhanced vmap node implementation designed to address the limitations of the legacy approach.

3. Identification and detailed analysis of two remaining performance bottlenecks despite the enhanced vmap node implementation, along with their proposed solutions.

Join us to gain insights into the evolving design of vmalloc and its implications for performance in modern high-core-count systems.

Ever wonder how a bug fix lands on the kernel you are running on your system?

Would you like to know how to effectively get such fixes in the hands of most users?

From the time it gets submitted for review until an update is available in a distro, a lot of processes need to be followed and many people are involved.

The talk will go over some of these processes, some of the obstacles that may get in the way and how to make it easier for the people who do the work to get these fixes into the hands of as many people as possible.