Jason Thorpe wrote:
>
> I think this is a great thing to add to kern/ as a general facility.
> There are applications beyond just the network stack, as well -- any
> read-mostly hash table that has a lock or an array-of-locks around it is
> a good candidate for being replaced by this.
>
In such
> On Oct 16, 2018, at 1:00 PM, Mindaugas Rasiukevicius wrote:
>
> Hi,
>
> I recently implemented thmap [1] -- a concurrent trie-hash map, combining
> the elements of hashing and radix trie. It is supports lock-free lookups
> and concurrent inserts/deletes. It is design
Hi,
On 2018/10/17 5:00, Mindaugas Rasiukevicius wrote:
> Hi,
>
> I recently implemented thmap [1] -- a concurrent trie-hash map, combining
> the elements of hashing and radix trie. It is supports lock-free lookups
> and concurrent inserts/deletes. It is designed to be optim
Hi,
I recently implemented thmap [1] -- a concurrent trie-hash map, combining
the elements of hashing and radix trie. It is supports lock-free lookups
and concurrent inserts/deletes. It is designed to be optimal as a general
purpose *concurrent* associative array [2][3].
I am going to import
