Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming > #8764

Here is also the truth about Lockfree algorithms

Show key headers only | View raw

Hello,


Here is also the truth about Lockfree algorithms, here is what said
Martin Thompson:

"In my experience of teaching and developing lock-free algorithms, not 
only do they provide significant throughput advantages as evidenced 
here, they also provide much lower and less variance in latency."

Read more here:

https://mechanical-sympathy.blogspot.ca/2013/08/lock-based-vs-lock-free-concurrent.html

And are Lock-Free Concurrent Algorithms Practically Wait-Free?

This paper suggests a simple solution to this problem. We show that, for 
a large class of lock- free algorithms, under scheduling conditions 
which approximate those found in commercial hardware architectures, 
lock-free algorithms behave as if they are wait-free. In other words, 
programmers can keep on designing simple lock-free algorithms instead of 
complex wait-free ones, and in practice, they will get wait-free progress.

Read more here:

https://arxiv.org/abs/1311.3200


Thank you,
Amine Moulay Ramdane.

Back to comp.programming | Previous | Next | Find similar | Unroll thread

Thread

Here is also the truth about Lockfree algorithms Sky89 <Sky89@sky68.com> - 2018-05-05 19:59 -0400

csiph-web