[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <ZrLuelS7yx92SKk7@casper.infradead.org>
Date: Wed, 7 Aug 2024 04:48:10 +0100
From: Matthew Wilcox <willy@...radead.org>
To: JaeJoon Jung <rgbi3307@...il.com>
Cc: Greg Kroah-Hartman <gregkh@...uxfoundation.org>,
Linus Torvalds <torvalds@...ux-foundation.org>,
Sasha Levin <levinsasha928@...il.com>,
"Liam R . Howlett" <Liam.Howlett@...cle.com>,
linux-kernel@...r.kernel.org, linux-mm@...ck.org,
maple-tree@...ts.infradead.org, linux-fsdevel@...r.kernel.org
Subject: Re: [PATCH v2 1/2] lib/htree: Add locking interface to new Hash Tree
On Wed, Aug 07, 2024 at 09:21:12AM +0900, JaeJoon Jung wrote:
> Performance comparison when the number of indexes(nr) is 1M stored:
> The numeric unit is cycles as calculated by get_cycles().
>
> Performance store find erase
> ---------------------------------------------
> XArray 4 6 14
>
> Maple Tree 7 8 23
>
> Hash Tree 5 3 12
> ---------------------------------------------
>
> Please check again considering the above.
I would suggest that you find something to apply your new data structure
to. My suggestion would be the dcache, as I did with rosebush. That let
us find out that rosebush was not good for that application, and so I
abandoned work on it.
Powered by blists - more mailing lists