A data structure implementation that is more or less replicated in 50 or more places in the kernel seems like some nice low-hanging fruit to pick. That is just what Sasha Levin is trying to do with ...

Provides an introduction to and implementation of chained hash tables. Hash tables are data structures that are used when you are managing a large amount of data and need to be able find an item ...

The kernel's "relativistic" (or "resizable") hash table implementation came into the mainline during the 3.17 merge window. These tables can be resized while still allowing concurrent access by ...