- My new "invention" that is an enhanced fully scalable algorithm of a scalable reference counting with efficient support for weak references is finished and is coming soon.. - 1 Update
- More precision, read again.. - 1 Update
- A new scalable algorithm of mine is coming.. - 1 Update
- My efficient Threadpool engine with priorities that scales very well was ,updated to version 3.72 - 1 Update
| Horizon68 <horizon@horizon.com>: Feb 23 03:50PM -0800 Hello.. My new "invention" that is an enhanced fully scalable algorithm of a scalable reference counting with efficient support for weak references 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>: Feb 23 03:42PM -0800 Hello.. More precision, read again.. A new scalable algorithm of mine is coming.. Look at my powerful Threadpool that scales very well here: https://sites.google.com/site/scalable68/an-efficient-threadpool-engine-with-priorities-that-scales-very-well I have just enhanced its algorithm to be really efficient, and i think i will sell my new scalable algorithm and its implementation of a really powerful Threadpool that support priorities and that scales very well to Embarcadero or to Microsoft or to Google. Also i have invented another Threadpool that is fully scalable and that is suited for realtime safety-critical systems, and i think i will also sell it. Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: Feb 23 03:34PM -0800 Hello.. A new scalable algorithm of mine is coming.. Look at my powerful Threadpool that scales very well here: https://sites.google.com/site/scalable68/an-efficient-threadpool-engine-with-priorities-that-scales-very-well I have just enhanced its algorithm to be really efficient, and i think i will sell my new scalable algorithm and its implementation of a really powerful Threadpool that support priorities and that scales very well to Embarcadero or to Microsoft or to Google. Also i have invented another Threadpool that is fully scalable, and i think i will also sell it. Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: Feb 23 03:21PM -0800 Hello.. My efficient Threadpool engine with priorities that scales very well was updated to version 3.72 I have added an exception for the counter overflow, and now there is no false sharing and i think that it is working perfectly, i think that this invention of mine is a powerful Threadpool that scales very well and it also comes with a tutorial inside the zip file and it works with both Windows and Linux and it is easily portable to other operating systems. You can download it from: https://sites.google.com/site/scalable68/an-efficient-threadpool-engine-with-priorities-that-scales-very-well 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