|
|
Log in / Subscribe / Register

The first half of the 6.8 merge window

The first half of the 6.8 merge window

Posted Jan 14, 2024 18:37 UTC (Sun) by jd (guest, #26381)
In reply to: The first half of the 6.8 merge window by adobriyan
Parent article: The first half of the 6.8 merge window

I feel kinda sad. Yes, very small memory machines don't really exist any more, but there was something comforting about the fact that Linux could run perfectly well in a wider range of environments than any other OS in history.

You could also tailor the OS to your very specific needs, optimising it for any imaginable parameter. There were almost zero assumptions, everything cound be tuned, and there were even third-party patches for tuning even further.

Bereft of abandoned architectures and barely-used schedulers, some of that absolute freedom has been lost.

Having said that, it's the little-used stuff that accumulates the defects. Linux has as high a defect density as it has because some parts just aren't exercised enough.

The source code is also very very big and navigating round it to understand the consequences of additions will be perilous.

I shudder to think of how big the tree would be if someone created a "holistic" tree containing all the abandoned projects, obsolete filesystems, and deleted sections, updated to work with the rest of the kernel as it now stands. It's possible to imagine it would be 10-15 megs larger, maybe more.

It would certainly have a lot of defects that you could never debug because the necessary combination of hardware would no longer exist anywhere.

(Having said that, the obsolete formats archive that stores all obsoleted technologies probably should have just such a Linux kernel, as that would provide the best chance of actually using any archaic technology. If it has ever been for a computer, odds are soneone wrote Linux support for it at some point.)


to post comments

The first half of the 6.8 merge window

Posted Jan 14, 2024 18:56 UTC (Sun) by willy (subscriber, #9762) [Link]

Before SLOB was removed, there was considerable effort put into making sure that SLUB worked as well on low memory machines as SLOB did. But this is SLAB. I don't think there are any remaining workloads where SLAB outperformed SLUB. This simplification allows us to make more optimisations going forward -- which will also benefit low memory machines! There is nothing to be sad about here.

Having unused code in the tree holds us back. I'm just looking at NTFS and wondering whether I need to put in the effort to convert it to folios or whether we should delete it, since we now have NTFS3 in-tree. It'll probably save three months to just delete it.

The first half of the 6.8 merge window

Posted Jan 14, 2024 22:05 UTC (Sun) by pm215 (subscriber, #98099) [Link]

I think in such a hypothetical "holistic kernel" project, the size of the code base would be no issue but the "updated to work with the rest of the kernel as it now stands" part would be a colossal amount of work, even to get to "compiles, maybe in theory could work, untested" state. It's often the prospect of that work that causes those obsolete, abandoned or deleted lumps of code to be abandoned in the first place... If you actually wanted to use any of that code then doing so in the context of the kernel it was developed in would have much higher chances of success IMHO.

The first half of the 6.8 merge window

Posted Jan 15, 2024 12:35 UTC (Mon) by farnz (subscriber, #17727) [Link]

There's a pattern that I've seen, more than once, in software, that the removal of SLAB and SLOB allocators to leave just SLUB fits.

First, you need a hard problem where there's no obvious solution without compromising on at least one "performance" axis; be that memory consumed, CPU time taken, complexity of understanding the solution, whatever. You need it to be hard, because otherwise people will find the optimum solution quickly.

Second, you need a solution to the problem that's a local optimum; in other words, if you exclude certain cases (such as low memory systems), this solution is optimal, and it looks like it's impossible to make it work for those cases. SLAB met this.

Third, someone needs to come forwards with a second solution to the problem that falls into a different local optimum, and is better than the previous solution for some cases, but worse for others. This gives you two ways to solve the problem - e.g. SLOB for low memory systems, SLAB for big systems - depending on your use case, and leaves most people content.

With all of the above in place, sooner or later someone will come along who's able to learn from both existing solutions and provide one that can be made equal to or better than the best of both existing solutions on all axes you care about. And once you have that solution, you might as well use it for every case that the old solutions were used for.

Note, too, that in this case, you end up not needing the old solutions (e.g. SLOB, SLAB) at all, because the new solution has now been optimized to the point where it's always the right choice. Nothing of significant value has been lost by scrapping the old solutions, because the new solution beats the old solution in every respect (bar backwards compatibility with something that assumes details about the old solution that weren't set in stone to begin with - e.g. something assuming that it can inline a hand-written free method for a SLAB-allocated object "knowing" how SLAB's data structures are laid out).


Copyright © 2026, Eklektix, Inc.
Comments and public postings are copyrighted by their creators.
Linux is a registered trademark of Linus Torvalds