Linux Weather Forecast
Welcome to the Linux Weather Forecast
This page is an attempt to track ongoing developments in the Linux development community that have a good chance of appearing in a mainline kernel and/or major distributions sometime in the near future. Your "chief meteorologist" is Jonathan Corbet, Executive Editor at LWN.net. If you have suggestions on improving the forecast (and particularly if you have a project or patchset that you think should be tracked), please add your comments to the Discussion page. There's a blog that reports on the main changes to the forecast. You can view it directly or use a feed reader to subscribe to the blog feed. You can also subscribe directly to the changes feed for this page to see feed all forecast edits.
Current conditions: The 3.17 kernel was released on October 5, 2014. Some of the major features in this release are:
- There are four new system calls in 3.17, rather more than the usual number. They are:
- getrandom(), a way for programs to obtain random data without the need to open any special files.
- seccomp(), a new way of accessing the "secure computing" capability with better control over system call filters in threaded applications.
- memfd_create(), which can be used to create a new in-memory data structure called a "memfd". A memfd can be used to securely pass data between processes that do not necessarily trust each other.
- kexec_file_load(), a new version of the "kexec" capability that allows one kernel to boot directly into another without going through the system BIOS. The main purpose of this work is to allow the kernel to verify signatures on the new kernel, allowing it to be used on systems running in the UEFI secure boot environment.
- A fair amount of work has been done toward an eventual solution to the "year 2038" problem. 32-bit systems will run out of space to represent times in January of that year, leading to all kinds of problems. Since systems being deployed now may still be operational then, it is important to get a solution into place soon. That solution does not yet exist in any complete form, but the kernel's core timekeeping code is now ready.
- The SCSI subsystem now has multiqueue block support, an upgrade which should greatly increase its scalability in future releases.
Over 12,000 changesets were contributed by just over 1,400 developers in this cycle; see this article for details on where the code in this release came from.
Short-term forecast: the 3.18 kernel can be expected in early December. Some of the changes that have been merged for this release include:
- The bpf() system call has been added. This call provides user-space access to the extended Berkeley Packet Filter functionality added in recent kernel releases. eBPF is a general-purpose virtual machine that is likely to find applications throughout the kernel.
- Some significant networking performance improvements have been added, allowing even a slow machine to drive a fast interface at full wire speed, even when small packets are being transmitted. As this has been a problematic area for Linux networking performance for some time, this is an important speedup.
- Other additions to the networking code include the "foo over UDP" subsystem, support for the Data Center TCP congestion control protocol, and support for the "Geneve" generic network virtualization protocol.
Although it has not yet been merged as of this writing, chances are good that the overlayfs union filesystem will finally be brought into the mainline during this development cycle. Overlayfs allows filesystems to be laid on top of each other; it has numerous uses, including making life easier for those managing containerized systems.
As with the weather, there are no certainties about what may be merged into the Linux kernel going forward; every change is evaluated on both its merits and its long-term maintenance costs. Here are a few things on the horizon that are worth watching, though.
The Android kernel patches. There has been much gnashing of teeth about the out-of-tree Android patches over the years. At this point, though, the bulk of that code has been merged upstream. In some cases, including the infamous wakelocks, an alternative solution was developed upstream and Android has migrated over to it. The biggest remaining piece is the ION memory allocator; that code has now found its way into the staging tree for the 3.14 release.
The Btrfs filesystem is taking longer than anybody might have liked to reach production readiness, but things are getting closer. Important features, like RAID5/6 support have been merged, and bugs are being squashed. We may well see at least one major distribution adopt Btrfs by default in 2014.
Control groups are the mechanism by which the kernel gathers processes into hierarchical groups; it can then apply policies and resource usage limits to those groups. This feature remains under intensive development, and a lot of changes can be expected over the course of the next year. See this article for a description of some of the ongoing issues in this area.
NUMA scheduling. Non-uniform memory access (NUMA) machines will only perform well if running processes and their memory are kept on the same nodes; otherwise the cross-node memory accesses will slow things down considerably. NUMA scheduling performance on Linux is not as good as users think it should be. The good news is that quite a bit of development effort has gone into solving this problem over the course of the last year. The 3.9 kernel included some new infrastructure, and 3.13 includes a much improved scheduler for NUMA systems.
Power-aware scheduling. On systems with multiple cores (and even cellphones are multi-core these days), quite a bit of power savings can be had by shutting down CPUs when they are not needed. Overly aggressive powering down can make things worse, though, so care is needed. There are several patch sets out there, but there are still significant disagreements over how this problem should be solved. That said, expect significant progress in this area in the 2014 time frame.
This work is licensed under a Creative Commons Attribution-ShareAlike 3.0 License.