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

Groups > comp.programming.threads > #4111

About my scalable algorithms and about PhDs papers and computer science..

Show all headers | View raw

Hello...

Read this:

About my scalable algorithms and about PhDs papers and computer science..

Look at This PhD paper of a Scalable Concurrent Priority Queue Algorithms:

http://people.csail.mit.edu/shanir/publications/SZ-priority.pdf

This queue is "not" bound, and i think it uses a mechanism such as an 
elimination array..

And look at this one of a PhD paper called: Using Elimination to 
Implement Scalable and Lock-Free FIFO Queues :

http://www.cs.tau.ac.il/~shanir/nir-pubs-web/Papers/SPAA2005.pdf

I think it is not good or perfect because it uses an elimination array, 
so when there is no contention or no elimination it doesn't scale.
Also about network of SPSC queues to form MPMC, read here:

https://books.google.ca/books?id=jZG_DQAAQBAJ&pg=PA276&lpg=PA276&dq=SPSC+and+queue+and+MPMC&source=bl&ots=KwfRYpYWW3&sig=GYE7Sn7ZlhNsJISvTjV4bXnjvDc&hl=en&sa=X&ved=0ahUKEwia4fKKjojaAhUCuVkKHZnbBvMQ6AEIjgEwCQ#v=onepage&q=SPSC%20and%20queue%20and%20MPMC&f=false


As you have noticed a matrix of (N-1)*(N-1) SPSC queues is needed to 
compose an MPMC queue , and strict FIFO order can be broken in it, this 
is not good, this is why i said also:

Other than the strict FIFO order that can be broken, here is another 
problem with the distributed network of SPSC queues, here it is:

-- 

5. finally, SPSC may not be a good point for massive ITC(inter-thread 
communication):.

Because the space complexity goes in O(N^2), N is the number of threads. 
It is not rare to see a server with 1k or 2k hardware threads. And "many 
core" is the final destination of CPU from current sight.

---
Read all the following webpage and the responses to it to understand:

https://www.infoq.com/articles/High-Performance-Java-Inter-Thread-Communications


But my fully scalable FIFO queue that i have invented has completely 
"revolutionized" computer science, because it is the "perfect" scalable 
FIFO queue that is fully scalable even if there is no
contention, I have implemented three versions of my scalable FIFO queue, 
here they are:

1- A fully scalable FIFO queue that is bound and that is not blocking on 
the producer side and that is blocking on the consumer side.

2- A fully scalable FIFO queue that is unbound and that is not blocking 
on the producer side and that is blocking on the consumer side.

3- A fully scalable FIFO queue that is bound and that is blocking on the 
producer side and that is blocking on the consumer side.

And i have also invented a fully scalable Threadpool.


I will sell them to Embarcadero and to other software companies such as 
Microsoft and Google etc.

Also i will sell them to CAE here, because they need to scale more to 
many many cores, read here to know about this company:

https://www.cray.com/blog/extreme-scaling-in-cae-applications/

Here is CAE company:

http://www.cae.com/

And i have also invented a fully scalable reference counting with 
efficient support for weak references, here it is:

https://sites.google.com/site/aminer68/scalable-reference-counting-with-efficient-support-for-weak-references


Thank you,
Amine Moulay Ramdane.

Back to comp.programming.threads | Previous | Next | Find similar | Unroll thread

Thread

About my scalable algorithms and about PhDs papers and computer science.. computer45 <computer45@cyber.com> - 2018-03-25 15:03 -0400

csiph-web