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.