Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
Are Lock-Free Concurrent Algorithms Practically Wait-Free?
9 views
Skip to first unread message
Sky89
May 3, 2018, 7:27:31 PM5/3/18
to
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.
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.
0 new messages