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

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

Who said that lockfree algorithms and waitfree algorithms and ,scalable algorithms are hard ?

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

Contents

  Who said that lockfree algorithms and waitfree algorithms and ,scalable algorithms are hard ? aminer <aminer@toto.net> - 2014-04-25 19:08 -0700

#2264 — Who said that lockfree algorithms and waitfree algorithms and ,scalable algorithms are hard ?

Hello,


Who said that lockfree algorithms and waitfree algorithms and
scalable algorithms are hard ? as you have noticed i have tried to easy 
the job for you by inventing scalable algorithms and as you have noticed 
i have invented today a new algorithm of a very fast concurrent FIFO queue..

Here it is: http://pages.videotron.com/aminer/CQueue1.htm


And i am right now thinking about my next invention , so stay tunned !
and enjoy all my programming inventions that you will find at:


http://pages.videotron.com/aminer/


Thank you,
Amine Moulay Ramdane.

[toc] | [standalone]

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

csiph-web