[dm-devel] [Bcache v13 12/16] bcache: Bset code (lookups within a btree node)
Tejun Heo
tj at kernel.org
Wed May 23 20:49:14 UTC 2012
On Wed, May 23, 2012 at 10:55:44AM -0700, Tejun Heo wrote:
> How much benefit are we gaining by doing this float thing? Any chance
> we can do something simpler? As long as it's properly encapsulated,
> it shouldn't be too bad but I keep having the suspicion that a lot of
> complexity is added for unnecessary level of optimization.
e.g. how much performance gain does it provide compared to just using
u64 in binary search tree combined with last search result hint for
sequential accesses?
Thanks.
--
tejun
More information about the dm-devel
mailing list