- I have just invented other more powerful scalable algorithms - 1 Update
- Read again, i correct a last typo because i write fast - 1 Update
- More evidence about my work.. - 1 Update
- I am like a PhD researcher and i am competing against high-tech compagnies and against the best PhD researchers - 1 Update
| Horizon68 <horizon@horizon.com>: Mar 16 02:09PM -0700 Hello... I have just invented other more powerful scalable algorithms, read below(they are now both bounded and unbounded), so i think i have just "revolutionized" computing. I am like a PhD researcher and i am competing against high-tech compagnies and against the best PhD researchers, because i am an inventor of many scalable algorithms and there implementations, read the following to notice it: As you have noticed i am a white arab that is a gentleman type of person, I am also a more serious computer programmer that is an "inventor" of many scalable algorithms and there implementations, and i am able to dance a beautiful dance with high-tech companies such Microsoft and Google and Oracle and Embarcadero and such big high-tech software compagnies, because i am like a PhD researcher that is inventing scalable algorithms, and i also know how to "dance" a "beautiful" dance on the following USA beautiful song: https://www.youtube.com/watch?v=2s4slliAtQU&list=RD2s4slliAtQU&start_radio=1 This why i wrote the following poem to make you understand more my way: == Is a beautiful dance a romance ? Or is a beautiful dance a show of common sense ? A beautiful dance is not only an instinct Since beautifulness is feeling the essence Since beautifulness is a beautiful cadence Since beautifulness is also intelligence Since beautifulness is a beautiful dance of patience and tolerance Since beautifulness is a beautiful dance of transcendence So you have to know how to dance the beautiful dance To be able to "advance" by evidence. == So what is my new beautiful dance that i am dancing ? I have just invented the following algorithms that i will sell to high-tech big software compagnies: And as i said Scalable method for producer and consumer elimination is already patented, here it is: https://patents.google.com/patent/US7779165 But i have already "invented" the following scalable algorithms and there implementations that don't use elimination, here they are: - Fully Scalable FIFO queue both unbounded and bounded - Fully scalable LIFO stack both bounded and unbounded. - Fully scalable LIFO priority stack both bounded and unbounded - Fully scalable FIFO priority queue both bounded and unbounded and with limited number of priorities(up to 25 or something like that). But as you have noticed the following invention is patented: Scalable method for producer and consumer elimination is already patented, here it is: https://patents.google.com/patent/US7779165 This invention of the elimination method has given the following invention that uses "elimination" that as i said is patented: Scalable Concurrent Priority Queue Algorithms http://people.csail.mit.edu/shanir/publications/SZ-priority.pdf And elimination method above that is "patented" has given a scalable lockfree LIFO stack and a scalable FIFO queue that use elimination, but the weakness of those algorithms that use elimination is that: if we have, say, bursts of push calls followed by bursts of pop calls, there will again be no elimination and therefore no parallelism. This is why i have "solved" this weakness or problem by revolutionizing computing by inventing my above scalable algorithms that are fully scalable, and my scalable algorithms above have permit me to invent a fully scalable Threadpool and fully scalable Threadpool with priorities, this is why my above scalable algorithms will revolutionize computing. So as you are noticing i am an inventor of many scalable algorithms. Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: Mar 16 01:21PM -0700 Hello.. Read this: Read again, i correct a last typo because i write fast: I am like a PhD researcher and i am competing against high-tech compagnies and against the best PhD researchers, because i am an inventor of many scalable algorithms and there implementations, read the following to notice it: As you have noticed i am a white arab that is a gentleman type of person, I am also a more serious computer programmer that is an "inventor" of many scalable algorithms and there implementations, and i am able to dance a beautiful dance with high-tech companies such Microsoft and Google and Oracle and Embarcadero and such big high-tech software compagnies, because i am like a PhD researcher that is inventing scalable algorithms, and i also know how to "dance" a "beautiful" dance on the following USA beautiful song: https://www.youtube.com/watch?v=2s4slliAtQU&list=RD2s4slliAtQU&start_radio=1 This why i wrote the following poem to make you understand more my way: == Is a beautiful dance a romance ? Or is a beautiful dance a show of common sense ? A beautiful dance is not only an instinct Since beautifulness is feeling the essence Since beautifulness is a beautiful cadence Since beautifulness is also intelligence Since beautifulness is a beautiful dance of patience and tolerance Since beautifulness is a beautiful dance of transcendence So you have to know how to dance the beautiful dance To be able to "advance" by evidence. == So what is my new beautiful dance that i am dancing ? I have just invented the following algorithms that i will sell to high-tech big software compagnies: And as i said Scalable method for producer and consumer elimination is already patented, here it is: https://patents.google.com/patent/US7779165 But i have already "invented" the following scalable algorithms and there implementations that don't use elimination, here they are: - Fully Scalable FIFO queue both unbounded and bounded - Fully scalable LIFO stack that is unbounded - Fully scalable LIFO priority stack that is unbounded - Fully scalable FIFO priority queue that is unbounded with limited number of priorities(up to 25 or something like that). But as you have noticed the following invention is patented: Scalable method for producer and consumer elimination is already patented, here it is: https://patents.google.com/patent/US7779165 This invention of the elimination method has given the following invention that uses "elimination" that as i said is patented: Scalable Concurrent Priority Queue Algorithms http://people.csail.mit.edu/shanir/publications/SZ-priority.pdf And elimination method above that is "patented" has given a scalable lockfree LIFO stack and a scalable FIFO queue that use elimination, but the weakness of those algorithms that use elimination is that: if we have, say, bursts of push calls followed by bursts of pop calls, there will again be no elimination and therefore no parallelism. This is why i have "solved" this weakness or problem by revolutionizing computing by inventing my above scalable algorithms that are fully scalable, and my scalable algorithms above have permit me to invent a fully scalable Threadpool and fully scalable Threadpool with priorities, this is why my above scalable algorithms will revolutionize computing. So as you are noticing i am an inventor of many scalable algorithms. Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: Mar 16 01:16PM -0700 Hello... More evidence about my work.. As you have noticed i am a white arab that is a gentleman type of person, and i am an "inventor" of many scalable algorithms and there implementations.. You have to know me more, i give you an example: i have invented a "fully" scalable reference counting with efficient support for weak references, so when you type "scalable reference counting" on Google search, my "invention" is the first one that shows up, here is the Google search results: https://www.google.com/search?source=hp&ei=1D2NXN6OKYaQ5wK8jJvIDw&q=scalable+reference+counting&btnK=Google+Search&oq=scalable+reference+counting&gs_l=psy-ab.3..35i39.394.3959..4179...0.0..0.89.2063.28......0....1..gws-wiz.....0..0i131j0j0i20i263j0i22i30.Im2gflxOWSA As you have noticed i am like a PhD researcher, because i am inventing scalable algorithms and competing with inventions of the best PhD researchers like the following one that is an jewish from Israel: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.2448 Read my writing below to know more about my new invention: My new "invention" that is an enhanced fully scalable algorithm is finished and is coming soon.. I have just enhanced "much" more my "invention" of a scalable algorithm of a scalable reference counting with efficient support for weak references, i think i am the only one who has invented this scalable algorithm, because it is the only one who is suited for non-garbage collecting languages such as C++ and Rust and Delphi, and i have just made my enhanced algorithm fully scalable on manycores and multicores and NUMA systems by using a clever scalable algorithm, so i think i will "sell" my new invention that is my enhanced scalable reference counting algorithm with efficient support for weak references and its implementation to Microsoft or to Google or to Intel or Embarcadero And about memory safety and memory leaks in programming languages.. Memory safety is the state of being protected from various software bugs and security vulnerabilities when dealing with memory access, such as buffer overflows and dangling pointers. I am also working with Delphi and FreePascal and C++, and as you have noticed i have invented a scalable reference counting with efficient support for weak references that is really powerful, read about it and download it from here(it is the Delphi and FreePascal implementation): https://sites.google.com/site/scalable68/scalable-reference-counting-with-efficient-support-for-weak-references And you have to understand that this invention of mine solves the problem of dangling pointers and it solves the problem of memory leaks and this reference counting of mine is also "scalable", and i think that this invention of mine is the only one that you will find, and you will not find it in C++ and you will not find it in Rust. Also Delphi and FreePascal detect the out of bounds in arrays and strings like this by making range checks enabled: In the {$R+} state, all array and string-indexing expressions are verified as being within the defined bounds, and all assignments to scalar and subrange variables are checked to be within range. **If a range check fails, an ERangeError exception is raised (or the program is terminated if exception handling is not enabled). Range Checks is OFF by default. To enable it, you can add this directive to your code: {$RANGECHECKS ON} You can use also generic (template) style containers for bound checking, my following writing to understand more: About C++ and Delphi and FreePascal generic (template) style containers.. Generics.Collections of Delphi and FreePascal for generic (template) style containers that you can download from here: https://github.com/maciej-izak/generics.collections TList of Generics.Collections of Delphi and FreePascal is implemented the same as STL C++ Vectors: they are array-based. And since data structureS are the same then also performance should be comparable. So I've done a small test between Tlist of Generics.Collections of Delphi and FreePascal and C++ vector, it's an addition of 3000000 records of 16 byte length, in one loop, here is the results: Tlist time = 344ms Vector time = 339ms It seems they are the same, the test use only the function ( List.add , vector.push_back). STL vectors with the at() and Delphi TList of Generics.Collections of Delphi and FreePascal perform bounds checking. So i think that with my invention above and with all my other inventions that are my scalable algorithms and there implementations and such in C++ and Delphi and FreePascal that you will find in my following website, Delphi and FreePascal have become powerful: https://sites.google.com/site/scalable68/ Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: Mar 16 01:14PM -0700 Hello.. Read this: I am like a PhD researcher and i am competing against high-tech compagnies and against the best PhD researchers, because i am an inventor of many scalable algorithms and there implementations, read the following to noticed it: As you have noticed i am a white arab that is a gentleman type of person, I am also a more serious computer programmer that is an "inventor" of many scalable algorithms and there implementations, and i am able to dance a beautiful dance with high-tech companies such Microsoft and Google and Oracle and Embarcadero and such big high-tech software compagnies, because i am like a PhD researcher that is inventing scalable algorithms, and i also know how to "dance" a "beautiful" dance on the following USA beautiful song: https://www.youtube.com/watch?v=2s4slliAtQU&list=RD2s4slliAtQU&start_radio=1 This why i wrote the following poem to make you understand more my way: == Is a beautiful dance a romance ? Or is a beautiful dance a show of common sense ? A beautiful dance is not only an instinct Since beautifulness is feeling the essence Since beautifulness is a beautiful cadence Since beautifulness is also intelligence Since beautifulness is a beautiful dance of patience and tolerance Since beautifulness is a beautiful dance of transcendence So you have to know how to dance the beautiful dance To be able to "advance" by evidence. == So what is my new beautiful dance that i am dancing ? I have just invented the following algorithms that i will sell to high-tech big software compagnies: And as i said Scalable method for producer and consumer elimination is already patented, here it is: https://patents.google.com/patent/US7779165 But i have already "invented" the following scalable algorithms and there implementations that don't use elimination, here they are: - Fully Scalable FIFO queue both unbounded and bounded - Fully scalable LIFO stack that is unbounded - Fully scalable LIFO priority stack that is unbounded - Fully scalable FIFO priority queue that is unbounded with limited number of priorities(up to 25 or something like that). But as you have noticed the following invention is patented: Scalable method for producer and consumer elimination is already patented, here it is: https://patents.google.com/patent/US7779165 This invention of the elimination method has given the following invention that uses "elimination" that as i said is patented: Scalable Concurrent Priority Queue Algorithms http://people.csail.mit.edu/shanir/publications/SZ-priority.pdf And elimination method above that is "patented" has given a scalable lockfree LIFO stack and a scalable FIFO queue that use elimination, but the weakness of those algorithms that use elimination is that: if we have, say, bursts of push calls followed by bursts of pop calls, there will again be no elimination and therefore no parallelism. This is why i have "solved" this weakness or problem by revolutionizing computing by inventing my above scalable algorithms that are fully scalable, and my scalable algorithms above have permit me to invent a fully scalable Threadpool and fully scalable Threadpool with priorities, this is why my above scalable algorithms will revolutionize computing. So as you are noticing i am an inventor of many scalable algorithms. 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