Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
About PhDs in computer science..
2 views
Skip to first unread message
computer45
Mar 22, 2018, 4:45:25 PM3/22/18
to
Hello,
Read this:
About PhDs in 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.
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.
Read this:
About PhDs in 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.
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.
Kaz Kylheku
Mar 22, 2018, 5:16:49 PM3/22/18
to
On 2018-03-22, computer45 <compu...@cyber.com> wrote:
> I will sell them to Embarcadero and to other software companies such as
> Microsoft and Google etc.
Why would they pay you when they can just download your stuff
> I will sell them to Embarcadero and to other software companies such as
> Microsoft and Google etc.
and copy its ideas?
Oh, you mean because you will have patents on the ideas?
If you want patents, you have to actually get yourself an IP lawyer
and file patent applications; have you done that?
Oops; that lawyer will tell you that you can't patent ideas
that have already been published by someone posting to
comp.programming.threads (even if that someone was you).
If you want to get patents on technological developments, you have to
work in *secrecy*. Don't disclose anything. If you do show anything to
anyone, you have to get them to sign a non-disclosure agreement (NDA).
computer45
Mar 22, 2018, 5:21:17 PM3/22/18
to
think that they have to agree because brillant work is brillant work, I
think that humans will understand my work and they will agree with me.
computer45
Mar 22, 2018, 5:28:30 PM3/22/18
to
read again , i correct a typo
On 3/22/2018 5:16 PM, Kaz Kylheku wrote:
I want to sell them to humanity, so to different software companies, i
think that they have to agree because brilliant work is brilliant work,
I think that humans will understand my work and they will agree with me.
0 new messages