Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming.threads > #3911 > unrolled thread

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

Back to article view | Back to comp.programming.threads

Contents

  The Scalable and lock-free first-in-first-out queue implementation of ,Mark Moir, Ori Shalev, Nir Shavit is patented Intelli2 <intelli2@mama.com> - 2017-10-30 22:08 -0400

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

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.

[toc] | [standalone]

Back to top | Article view | comp.programming.threads

csiph-web