SLEB is a merging of SLUB with some queuing concepts from SLAB and a new way of managing objects in the slabs using bitmaps. It uses a percpu queue so that free operations can be properly buffered and a bitmap for managing the free/allocated state in the slabs. It is slightly more inefficient than SLUB (due to the need to place large bitmaps --sized a few words--in some slab pages if there are more than BITS_PER_LONG objects in a slab) but in general does compete well with SLUB in terms of space use. The SLAB scheme of not touching the object during management is adopted. SLEB can efficiently free and allocate cache cold objects without causing cache misses. There are numerous SLAB schemes that are not supported. Those could be added if needed and if they really make a difference. WARNING: This only ran successfully using hackbench in a kvm instance so far. -- To unsubscribe, send a message with 'unsubscribe linux-mm' in the body to majordomo@xxxxxxxxxx For more info on Linux MM, see: http://www.linux-mm.org/ . Don't email: <a href=mailto:"dont@xxxxxxxxx";> email@xxxxxxxxx </a>