Groups > comp.programming.threads > #4251

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

Path	csiph.com!eternal-september.org!feeder.eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail
From	Sky89 <Sky89@sky68.com>
Newsgroups	comp.programming.threads
Subject	Are Lock-Free Concurrent Algorithms Practically Wait-Free?
Date	Thu, 3 May 2018 23:27:09 -0400
Organization	A noiseless patient Spider
Lines	20
Message-ID	<pcg5sd$vru$2@dont-email.me> (permalink)
Mime-Version	1.0
Content-Type	text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding	7bit
Injection-Date	Thu, 3 May 2018 23:27:09 -0000 (UTC)
Injection-Info	reader02.eternal-september.org; posting-host="f80612b83378842e152c6e67de07aaa3"; logging-data="32638"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/d0H9+WO7rMEwZ0rNJxjjC"
User-Agent	Mozilla/5.0 (Windows NT 10.0; WOW64; rv:52.0) Gecko/20100101 Thunderbird/52.7.0
Content-Language	en-US
X-Mozilla-News-Host	news://news.eternal-september.org:119
Cancel-Lock	sha1:ueWSwF6teXuigOSo+8MlPEzaWcE=
Xref	csiph.com comp.programming.threads:4251

Show key headers only | 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