Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
About are Lock-Free Concurrent Algorithms Practically Wait-Free?
1 view
Skip to first unread message
amin...@gmail.com
Jul 5, 2020, 3:27:25 PM7/5/20
to
Hello,
I have just read the following PhD paper:
About are Lock-Free Concurrent Algorithms Practically Wait-Free?
https://arxiv.org/pdf/1311.3200.pdf
And i have just read about the Class of Algorithms SCU(q, s),
and i have just noticed that the theorem says that there individual latency is O(n(q + s*√n)), so it makes this Class of Lockfree Algorithms Waitfree under scheduling conditions which approximate those found in commercial hardware architectures, so i think it is really useful in "practice".
So i invite you to look at my Lockfree algorithms here:
https://sites.google.com/site/scalable68/lockfree-bounded-lifo-stack-and-fifo-queue
Thank you,
Amine Moulay Ramdane.
I have just read the following PhD paper:
About are Lock-Free Concurrent Algorithms Practically Wait-Free?
https://arxiv.org/pdf/1311.3200.pdf
And i have just read about the Class of Algorithms SCU(q, s),
and i have just noticed that the theorem says that there individual latency is O(n(q + s*√n)), so it makes this Class of Lockfree Algorithms Waitfree under scheduling conditions which approximate those found in commercial hardware architectures, so i think it is really useful in "practice".
So i invite you to look at my Lockfree algorithms here:
https://sites.google.com/site/scalable68/lockfree-bounded-lifo-stack-and-fifo-queue
Thank you,
Amine Moulay Ramdane.
0 new messages