lkml.org 
[lkml]   [2008]   [Aug]   [12]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [RFC/PATCH] SLUB: dynamic per-cache MIN_PARTIAL
On Tue, Aug 05, 2008 at 12:39:36AM +0300, Pekka J Enberg wrote:
> This patch changes the static MIN_PARTIAL to a dynamic per-cache ->min_partial
> value that is calculated from object size. The bigger the object size, the more
> pages we keep on the partial list.
>
> I tested SLAB, SLUB, and SLUB with this patch on Jens Axboe's 'netio' example
> script of the fio benchmarking tool. The script stresses the networking
> subsystem which should also give a fairly good beating of kmalloc() et al.

Hi Pekka,

We tested this patch and it was performance-neutral on TPC-C. I was
hoping it would give a nice improvement ... so I'm disappointed. But at
least there's no regression!

--
Intel are signing my paycheques ... these opinions are still mine
"Bill, look, we understand that you're interested in selling us this
operating system, but compare it to ours. We can't possibly take such
a retrograde step."


\
 
 \ /
  Last update: 2008-08-12 14:31    [W:0.034 / U:0.508 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site