| aminer68@gmail.com: Jul 05 12:27PM -0700 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. |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.programming.threads+unsubscribe@googlegroups.com. |
No comments:
Post a Comment