| lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC | |
|
Open Source and information security mailing list archives
| ||
|
Message-ID: <20080812122751.GY8618@parisc-linux.org> Date: Tue, 12 Aug 2008 06:27:51 -0600 From: Matthew Wilcox <matthew@....cx> To: Pekka J Enberg <penberg@...helsinki.fi> Cc: linux-kernel@...r.kernel.org, linux-mm@...ck.org, akpm@...ux-foundation.org, cl@...ux-foundation.org Subject: Re: [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." -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@...r.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists