Sujet : Re: Wait-free Hazard Pointers Using Std Atomics
De : chris.m.thomasson.1 (at) *nospam* gmail.com (Chris M. Thomasson)
Groupes : comp.lang.c++Date : 28. Jun 2025, 23:41:24
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <103pr2k$143sj$2@dont-email.me>
References : 1 2 3 4 5 6 7 8 9
User-Agent : Mozilla Thunderbird
On 6/27/2025 2:54 PM, jseigh wrote:
On 6/27/25 01:26, Chris M. Thomasson wrote:
On 6/23/2025 4:03 AM, jseigh wrote:
>
I've been doing reader lock-free too long. I just realized how
trivially simple it is to do read write lock-free for almost any data
structure. That's slightly embarrassing.
>
:^) Indeed. But, its not a bad skill to have. Well, at least to me.
I'm not talking about skill but a general lock-free technique for
adding or removing nodes from an arbitrary linked data structures.
It might be extendable to multiple nodes but I think there would
be restrictions.
How does the technique adapt to different methods of creating linked data structures?
I'm doing everything as though exercises these days. Looks good
so far. :)
:^)
Wait-free Hazard Pointers Using Std Atomics
Re: Wait-free Hazard Pointers Using Std Atomics