[lkml]   [2007]   [Feb]   [22]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: SLUB: The unqueued Slab allocator
Christoph Lameter <> writes:

> This is a new slab allocator which was motivated by the complexity of the
> with the existing implementation.

Thanks for doing that work. It certainly was long overdue.

> D. SLAB has a complex cache reaper
> SLUB does not need a cache reaper for UP systems.

This means constructors/destructors are becomming worthless?
Can you describe your rationale why you think they don't make
sense on UP?

> G. Slab merging
> We often have slab caches with similar parameters. SLUB detects those
> on bootup and merges them into the corresponding general caches. This
> leads to more effective memory use.

Did you do any tests on what that does to long term memory fragmentation?
It is against the "object of same type have similar livetime and should
be clustered together" theory at least.

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2007-02-22 17:57    [W:0.112 / U:0.404 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site