Read again...

[Intelli2]

Hello,


I have ported the following software of the implementation of scalable
Counting networks:

https://github.com/stephentu/counting-networks


But i have more and more analyzed it, and i have found that it doesn't
work as it is on multicore and NUMA systems, and it is not optimized to
avoid false sharing, so i have finally enhanced it more to be more
powerful, and i have just finished my own implementation that is more
powerful and that works correctly on multicore and NUMA systems.


So forget about the above project on Github, because it doesn't work
correctly.



Thank you,
Amine Moulay Rasmdane.

[Intelli2]

Hello,


To be more precise..

About my new algorithm..

I took a look on internet at the thread-safe FIFO queue using two
condition variables , one for the empty condition and one for the full
condition, and i have noticed that there algorithm is not working, so i
have come up with a new algorithm of a FIFO queue that is
starvation-free and that works, and that uses two condition variables,
one for the empty condition and one for the full condition, after that i
have enhanced it to be a new scalable aglorithm that is really powerful,
it is now scalable on multicore and NUMA systems. I have just finished
to implement it and it is really powerful.

So stay tuned !
Thank you,
Amine Moulay Ramdne.