lkml.org 
[lkml]   [2004]   [Jan]   [23]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
From
SubjectRE: buggy raid checksumming selection?
Date
> On Fri, Jan 23, 2004 at 11:40:53AM -0200, Evaldo Gardenali wrote:
>
> > Uhh. correct me if I am wrong, but shouldnt it select the
> fastest algorithm?
>
> No, if it can choose a function which avoids polluting the cache over
> one that doesn't, it will. Even if that means slightly less
> raw throughput
>
> This comes up time after time, maybe we need a printk in that case ?
>
> Dave

I'm not suggesting that anyone waste any time over this, but are there any
"real world" benchmarks of the "fastest" vs "non cache-polluting"
algorithms.

Could there be any situations whereby even with cache-pollution we'd get
better performance?

I know it depends on the workload mix and amount of I/O, but...

Just curious.

Phil
---------------------------------------------
Phil Randal
Network Engineer
Herefordshire Council
Hereford, UK
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-03-22 14:00    [W:0.023 / U:0.324 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site