I correct , read again..

[amin...@gmail.com]

Hello,

Chris M. Thomasson has repondrf to me and posted this:

https://groups.google.com/d/topic/lock-free/acjQ3-89abE/discussion

I think you are not getting the point, that you are using XADD with lock,
this doesn't scale at all, you have to understand what i am doing ,
my scalable fifo queues that i have just invented don't use XADD with Lock,
they use scalable counting networks that are truly scalable and they
use a technic that distribute on many fifo queues to be truly scalable,
my fifo queues are truly scalable on NUMA system.

Read the following (the counting network is truly scalable, please look at the graph inside the paper):

http://people.csail.mit.edu/shanir/publications/HLS.pdf

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.

[amin...@gmail.com]

Hello,

Chris M. Thomasson has reponded to me and posted this: