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

Groups > comp.programming > #8758 > unrolled thread

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

Back to article view | Back to comp.programming

Contents

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

#8758 — Are Lock-Free Concurrent Algorithms Practically Wait-Free?

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.

[toc] | [standalone]

Back to top | Article view | comp.programming

csiph-web