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
| ||
|
Date: Thu, 13 Feb 2020 07:50:05 -0800 From: Davidlohr Bueso <dave@...olabs.net> To: Andrew Morton <akpm@...ux-foundation.org> Cc: linux-kernel@...r.kernel.org, mcgrof@...nel.org, broonie@...nel.org, alex.williamson@...hat.com Subject: Re: [PATCH -next 0/5] rbtree: optimize frequent tree walks On Mon, 10 Feb 2020, Andrew Morton wrote: >Measurable for microbenchmarks, I think? But what benefit will a user >see, running a workload that is cared about? Well avoiding pointer chasing on large SMP systems has been shown to be something we care about in the past. And yes my performance data comes from an adhoc test scenario which only measures iteration latencies but that doesn't mean there isn't value here. Thanks, Davidlohr
Powered by blists - more mailing lists