Groups > comp.programming.threads > #4153

About PhDs in computer science and more..

Path	csiph.com!eternal-september.org!feeder.eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail
From	Sky89 <Sky89@sky68.com>
Newsgroups	comp.programming.threads
Subject	About PhDs in computer science and more..
Date	Mon, 9 Apr 2018 13:29:37 -0400
Organization	A noiseless patient Spider
Lines	70
Message-ID	<pag7u2$3jp$2@dont-email.me> (permalink)
Mime-Version	1.0
Content-Type	text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding	7bit
Injection-Date	Mon, 9 Apr 2018 17:29:38 -0000 (UTC)
Injection-Info	reader02.eternal-september.org; posting-host="dd0116abfaa013edfccca2fdd2e0a790"; logging-data="3705"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+SCFBpxNWePTiiFB8nduJW"
User-Agent	Mozilla/5.0 (Windows NT 10.0; WOW64; rv:52.0) Gecko/20100101 Thunderbird/52.7.0
Content-Language	en-US
X-Mozilla-News-Host	news://news.eternal-september.org:119
Cancel-Lock	sha1:yUG32PYo5g0CodPkbXNNImfAgV4=
Xref	csiph.com comp.programming.threads:4153

Show key headers only | View raw

Hello..


About PhDs in computer science and more..

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 , that's not good , 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, and strict FIFO order can be 
broken in network of SPSC queues to form MPMC, this is not good, this is 
why said also:


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 PhDs in computer science and more.. Sky89 <Sky89@sky68.com> - 2018-04-09 13:29 -0400

csiph-web