Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
About my new invention that is my scalable reference counting with efficient support for weak references
3 views
Skip to first unread message
amin...@gmail.com
Aug 7, 2019, 5:24:13 PM8/7/19
to
Hello,
About my new invention that is my scalable reference counting with efficient support for weak references:
As you have noticed i have provided you with my new invention that is a scalable reference counting with efficient support for weak references,
here it is:
https://sites.google.com/site/scalable68/scalable-reference-counting-with-efficient-support-for-weak-references
But i have to explain something:
There is an "atomic" increment in my algorithm when it first automatically "register" from a started thread, but it will
be "scalable" after the first step of registration and it will not register again from the started thread. But even though, it is really powerful.
But i have just enhanced my algorithm to a new fully scalable algorithm that will not need this atomic increment in my scalable algorithm when it first automatically register from a started thread, so it will be fully scalable, and i will perhaps sell this new fully scalable algorithm of mine and its implementation in Delphi to Embarcadero or to Microsoft or to Google or such software companies, this is why i will soon contact Embarcadero software company for that.
Thank you,
Amine Moulay Ramdane.
About my new invention that is my scalable reference counting with efficient support for weak references:
As you have noticed i have provided you with my new invention that is a scalable reference counting with efficient support for weak references,
here it is:
https://sites.google.com/site/scalable68/scalable-reference-counting-with-efficient-support-for-weak-references
But i have to explain something:
There is an "atomic" increment in my algorithm when it first automatically "register" from a started thread, but it will
be "scalable" after the first step of registration and it will not register again from the started thread. But even though, it is really powerful.
But i have just enhanced my algorithm to a new fully scalable algorithm that will not need this atomic increment in my scalable algorithm when it first automatically register from a started thread, so it will be fully scalable, and i will perhaps sell this new fully scalable algorithm of mine and its implementation in Delphi to Embarcadero or to Microsoft or to Google or such software companies, this is why i will soon contact Embarcadero software company for that.
Thank you,
Amine Moulay Ramdane.
0 new messages