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

Groups > comp.programming.threads > #4251

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

Show all headers | View raw

Hello,

Here is a very interesting paper:

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.threads | Previous | Next | Find similar | Unroll thread

Thread

Are Lock-Free Concurrent Algorithms Practically Wait-Free? Sky89 <Sky89@sky68.com> - 2018-05-03 23:27 -0400

csiph-web