On Thursday, December 27, 2018 at 9:55:57 PM UTC-8, Artur Brugeman wrote:
>
> Hi Chris,
>
> Thank you for your thoughts on this, my thinking was in line with yours
> and that's why I tried to add timed waiting in Dmitry's eventcount. I guess
> I need to spend some more time there and figure it
W dniu czwartek, 13 grudnia 2018 07:54:14 UTC+1 użytkownik segn napisał:
> Basically I'm looking for implementation of the same queue. In the
> project, the same principle was used for both thread-thread
> single-direction communication (typical master thread + # of worker
> threads; each cha
Hi,
sorry for resurrecting this old thread!
The link to the files (http://groups.google.com/group/lock-free/files) no
longer works.
I've downloaded the hash_map.zip file from your homepage, but this version
of the code only supports pod-types of 4 or 8 bytes. I am particularly
interested in yo
On Fri, Dec 28, 2018 at 1:22 PM wrote:
>
> Hi,
>
> sorry for resurrecting this old thread!
>
> The link to the files (http://groups.google.com/group/lock-free/files) no
> longer works.
> I've downloaded the hash_map.zip file from your homepage, but this version of
> the code only supports pod-ty
On Fri, Dec 28, 2018 at 10:57 AM segn wrote:
>
> W dniu czwartek, 13 grudnia 2018 07:54:14 UTC+1 użytkownik segn napisał:
>>
>> Basically I'm looking for implementation of the same queue. In the project,
>> the same principle was used for both thread-thread single-direction
>> communication (typ
On Wed, Dec 12, 2018 at 1:04 PM Per wrote:
>
> Hi Dmitry,
>
> First, I want to thank you for the fantastic resource you have put together
> on 1024cores.net. I have found it very helpful in my studies on lockfree
> algorithms.
>
> I have a question that I was hoping you could help me with. The "
Hi Dmitry,
in one of your last post you wrote:
I've uploaded modified hash map which supports strings (and any other
> satellite data) as keys/values:
> http://groups.google.com/group/lock-free/files
> There is example included which uses strings as both keys and values.
>
That made me think
This experimental algorithm uses only XCHG at the cost of having a consumer
wait for the next pointer to be set in a node. However, it allows for real
work to be done before any waits are performed. So, the "real" work should
provide a "natural backoff" that might minimize the waiting. The algor
