Digest for comp.programming.threads@googlegroups.com - 3 updates in 2 topics

comp.programming.threads@googlegroups.com

Google Groups

Topic digest
View all topics

• About my library and Linux - 1 Update
• Lockfree bounded LIFO stack and FIFO queue is here.. - 2 Updates

About my library and Linux

Sky89 <Sky89@sky68.com>: May 12 09:47PM -0400 Hello..     About my library and Linux:   As you have noticed i have provided you with a Lockfree bounded LIFO stack and a Lockfree bounded FIFO queue , they are very fast..   But as you have noticed the Lockfree FIFO queue works with both Windows and Linux, but the Lockfree stack works with only windows, but i am right now coming with a Lockfree unbound LIFO stack that works on Linux too.   They can be ported easily to other operating systems.   So stay tuned !   And you can port those Lockfree algorithms to C++     Thank youm Amine Moulay Ramdane.

Back to top

Lockfree bounded LIFO stack and FIFO queue is here..

Sky89 <Sky89@sky68.com>: May 12 07:33PM -0400 Hello,     Lockfree bounded LIFO stack and FIFO queue is here..   Description:   A fast Lockfree FIFO queue and a fast Lockfree LIFO Stack, they are bounded, the Lockfree FIFO queue was correct and enhanced by Amine Moulay Ramdane.   Read the following paper:   https://arxiv.org/pdf/1311.3200.pdf   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. It says on the Analysis of the Class SCU(q, s):   "Given an algorithm in SCU(q, s) on k correct processes under a uniform stochastic scheduler, the system latency is O(q + s*sqrt(k), and the individual latency is O(k(q + s*sqrt(k))."   So i think lockfree algorithms are very interesting to work with.   The size of the queue must be passed to the constructor and it must be the power of 2.     You can download them from:   https://sites.google.com/site/aminer68/lockfree-bounded-stack-and-queue     Language: FPC Pascal v2.2.0+ / Delphi 7+: http://www.freepascal.org/   Operating Systems: Windows, Mac OSX , Linux on (x86)...   Required FPC switches: -O3 -Sd   -Sd for delphi mode....   Required Delphi switches: -$H+   {$DEFINE CPU32} and {$DEFINE Windows32} for 32 bit systems   {$DEFINE CPU64} and {$DEFINE Windows64} for 64 bit systems       Thank you, Amine Moulay Ramdane.

Sky89 <Sky89@sky68.com>: May 12 07:49PM -0400 On 5/12/2018 7:33 PM, Sky89 wrote:   > A fast Lockfree FIFO queue and a fast Lockfree LIFO Stack, they are > bounded, the Lockfree FIFO queue was correct and enhanced by Amine > Moulay Ramdane.   I correct a typo:   I mean: the Lockfree FIFO queue was corrected and enhanced by Amine Moulay Ramdane.

Back to top

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.