Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #4099
| From | computer45 <computer45@cyber.com> |
|---|---|
| Newsgroups | comp.programming.threads |
| Subject | About PhDs in computer science.. |
| Date | 2018-03-22 16:45 -0400 |
| Organization | A noiseless patient Spider |
| Message-ID | <p914l2$7t9$8@dont-email.me> (permalink) |
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.
Back to comp.programming.threads | Previous | Next — Next in thread | Find similar | Unroll thread
About PhDs in computer science.. computer45 <computer45@cyber.com> - 2018-03-22 16:45 -0400
Re: About PhDs in computer science.. Kaz Kylheku <157-073-9834@kylheku.com> - 2018-03-22 21:16 +0000
Re: About PhDs in computer science.. computer45 <computer45@cyber.com> - 2018-03-22 17:21 -0400
Re: About PhDs in computer science.. computer45 <computer45@cyber.com> - 2018-03-22 17:28 -0400
csiph-web