| computer45 <computer45@cyber.com>: Mar 22 04:45PM -0400 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. |
| Kaz Kylheku <157-073-9834@kylheku.com>: Mar 22 09:16PM > 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 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 <computer45@cyber.com>: Mar 22 05:21PM -0400 On 3/22/2018 5:16 PM, Kaz Kylheku wrote: > 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). I want to sell them to humanity, so to different software companies, i 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. Thank you, Amine Moulay Ramdane. |
| computer45 <computer45@cyber.com>: Mar 22 05:28PM -0400 read again , i correct a typo On 3/22/2018 5:16 PM, Kaz Kylheku wrote: > 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). 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. Thank you, Amine Moulay Ramdane. |
| computer45 <computer45@cyber.com>: Mar 22 01:44PM -0400 Hello.. Read this: Read about those two World-Renowned scientists, they are also working on parallel programming: World-Renowned Professors Maurice Herlihy and Nir Shavit on Computer Science in Life Read more here: http://news.ifmo.ru/en/science/it/news/6821/ Thank you, Amine Moulay Ramdane. |
| computer45 <computer45@cyber.com>: Mar 22 01:24PM -0400 Hello, Read this: The department of computer science of University of Oxford is giving an advanced course on concurrent programming named: Concurrent Algorithms and Data Structures.. (But i am more capable than the level of this course because i have also already invented many scalable algorithms and there implementations) Here it is: Concurrent Algorithms and Data Structures Read more here: https://www.cs.ox.ac.uk/teaching/courses/2017-2018/cads/ Thank you, Amine Moulay Ramdane. |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.programming.threads+unsubscribe@googlegroups.com. |
No comments:
Post a Comment