Groups > comp.programming.threads > #4089

Read again, i correct

Path	csiph.com!eternal-september.org!feeder.eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail
From	computer45 <computer45@cyber.com>
Newsgroups	comp.programming.threads
Subject	Read again, i correct
Date	Mon, 19 Mar 2018 22:07:56 -0400
Organization	A noiseless patient Spider
Lines	39
Message-ID	<p8pcbs$d8v$5@dont-email.me> (permalink)
Mime-Version	1.0
Content-Type	text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding	7bit
Injection-Date	Mon, 19 Mar 2018 22:07:56 -0000 (UTC)
Injection-Info	reader02.eternal-september.org; posting-host="3c765d79771e148140ec444f0d0089fa"; logging-data="13599"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/lTWd8eUmalwHUTcT9Tq8JmLBc/494Z0s="
User-Agent	Mozilla/5.0 (Windows NT 10.0; WOW64; rv:52.0) Gecko/20100101 Thunderbird/52.6.0
Content-Language	en-US
X-Mozilla-News-Host	news://news.eternal-september.org:119
Cancel-Lock	sha1:MP/3JOxbOOtu7ju2Ge4kawq6umM=
Xref	csiph.com comp.programming.threads:4089

Show key headers only | View raw

Hello....


To understand better my new fully scalable reference counting algorithm, 
i will explain it to you:

I have optimized it more, now i am using only tokens and no antitokens 
in the balancers of the scalable counting networks, so i am only 
supporting increment, not decrement, so you have to be smart to invent 
it correctly, this is what i have done, so look at the 
AMInterfacedObject.pas file inside my zip file, you will notice that it 
uses counting_network_next_value() function, 
counting_network_next_value() increments the scalable counter network by 
1, the _AddRef() method is simple, it increment by 1 to increment the 
reference to the object, but look inside the _Release() method it calls 
counting_network_next_value() three times, and my invention is calling 
counting_network_next_value(cn1) first inside the _Release() method to 
be able to make my scalable algorithm works, so just debug it more and 
you will notice that my scalable algorithm is smart and it is working 
correctly, i have debugged it and i think it is working correctly.

I have found this Scalable Reference Counting Garbage Collector, and i 
think it is the only one invented by two PhDs from Israel:

http://www.cs.technion.ac.il/users/wwwb/Reports/1999/CS0967.pdf

So i have decided to invent and to implement another fully scalable 
reference counting algorithm with efficient support for weak references, 
it is fully scalable on multicores and manycores systems and here it is:

https://sites.google.com/site/aminer68/scalable-reference-counting-with-efficient-support-for-weak-references

Hope you will be happy with my project , because since i "love" Delphi, 
i have decided to bring the "best" to Delphi, my scalable reference 
counting algorithm can be ported to C++Builder or to other C++ compilers 
also.

Thank you,
Amine Moulay Ramdane.

Back to comp.programming.threads | Previous | Next | Find similar | Unroll thread

Thread

Read again, i correct computer45 <computer45@cyber.com> - 2018-03-19 22:07 -0400

csiph-web