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

comp.programming.threads@googlegroups.com

Google Groups

Topic digest
View all topics

• The Scalable and lock-free first-in-first-out queue implementation of ,Mark Moir, Ori Shalev, Nir Shavit is patented - 1 Update
• My Scalable FIFO queues are here.. - 2 Updates

The Scalable and lock-free first-in-first-out queue implementation of ,Mark Moir, Ori Shalev, Nir Shavit is patented

Intelli2 <intelli2@mama.com>: Oct 30 10:08PM -0400 Hello....   Read this:   The Scalable and lock-free first-in-first-out queue implementation of Mark Moir, Ori Shalev, Nir Shavit is patented:   Here is there patent:   http://www.google.sr/patents/US7836228   And here is there paper:   http://people.csail.mit.edu/shanir/publications/SPAA2005.pdf     But my scalable FIFO queues that i have just invented are freewares , and i think they are better:   This is Scalable FIFO queues version 1.0, this is the windows version, the Linux version and C++ version for Windows and Linux are coming..   Those are two scalable FIFO queues, one is bounded and the other unbounded, they use a distributed technic over many FIFO queues and they use scalable counting networks so that to be scalable, you can test them on NUMA systems to notice that they are truly scalable.   And counting networks are truly scalable and are a special type of balancer networks which count.   Look at my port to Delphi and FreePascal of scalable counting networks here:   https://sites.google.com/site/aminer68/scalable-counting-networks-for-delphi-and-freepascal   You can download my Scalable FIFO queues from:   https://sites.google.com/site/aminer68/scalable-fifo-queues       Thank you, Amine Moulay Ramdane.

Back to top

My Scalable FIFO queues are here..

Intelli2 <intelli2@mama.com>: Oct 30 07:35PM -0400 Hello..   Read this:   My Scalable FIFO queues are here..   This is Scalable FIFO queues version 1.0, this is the windows version, the Linux version and C++ version are coming..   Author: Amine Moulay Ramdane   Description:   Those are two scalable FIFO queues, one is bounded and the other unbounded, they use a distributed technic over many FIFO queues and they use scalable counting networks so that to be scalable, you can test them on NUMA systems to notice that they are truly scalable.   And counting networks are truly scalable and are a special type of balancer networks which count.   Look at my port to Delphi and FreePascal of scalable counting networks here:   https://sites.google.com/site/aminer68/scalable-counting-networks-for-delphi-and-freepascal   You can download my Scalable FIFO queues from:   https://sites.google.com/site/aminer68/scalable-fifo-queues     - Platform: Windows and Linux(x86)   Required FPC switches: -O3 -Sd -dFPC -dFreePascal   -Sd for delphi mode....   Required Delphi switches: -$H+ -DDelphi   For Delphi XE-XE7 use the -DXE switch   {$DEFINE CPU32} and {$DEFINE Windows32} for 32 bit systems   {$DEFINE CPU64} and {$DEFINE Windows64} for 64 bit systems     Thank you, Amine Moulay Ramdane.

Intelli2 <intelli2@mama.com>: Oct 30 07:52PM -0400 Hello,   You have to pass the number of queues to the constructor so that to scale.     Thank you, 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.