About my new invention that is my scalable reference counting with efficient support for weak references

X-Received	by 2002:ac8:19d8:: with SMTP id s24mr10206803qtk.44.1565213134853; Wed, 07 Aug 2019 14:25:34 -0700 (PDT)
X-Received	by 2002:aca:3a04:: with SMTP id h4mr138484oia.90.1565213134564; Wed, 07 Aug 2019 14:25:34 -0700 (PDT)
Path	csiph.com!news.mixmin.net!proxad.net!feeder1-2.proxad.net!209.85.160.216.MISMATCH!b26no9975860qtq.0!news-out.google.com!y1ni139qtn.0!nntp.google.com!b26no9975857qtq.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups	comp.lang.pascal.misc
Date	Wed, 7 Aug 2019 14:25:34 -0700 (PDT)
Complaints-To	groups-abuse@google.com
Injection-Info	glegroupsg2000goo.googlegroups.com; posting-host=24.203.209.97; posting-account=R-6XjwoAAACnHXTO3L-lyPW6wRsSmYW9
NNTP-Posting-Host	24.203.209.97
User-Agent	G2/1.0
MIME-Version	1.0
Message-ID	<573fa69e-e2f4-403c-8047-4a3ceea971f0@googlegroups.com> (permalink)
Subject	About my new invention that is my scalable reference counting with efficient support for weak references
From	aminer68@gmail.com
Injection-Date	Wed, 07 Aug 2019 21:25:34 +0000
Content-Type	text/plain; charset="UTF-8"
Content-Transfer-Encoding	quoted-printable
Xref	csiph.com comp.lang.pascal.misc:2448

Show key headers only | View raw

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.

Back to comp.lang.pascal.misc | Previous | Next | Find similar

Thread

About my new invention that is my scalable reference counting with efficient support for weak references aminer68@gmail.com - 2019-08-07 14:25 -0700

csiph-web