1. Forum
  2. Usenet
  3. COMP.LANG.PASCAL.MISC

  • About why is memory reclamation so important?

    From Wisdom91@21:1/5 to All on Mon Jul 13 17:06:33 2020
    Hello,

    Read this:


    About why is memory reclamation so important?

    I am a white arab, and here is one more proof that i am
    smart like a genius:

    Read the following from a PhD researcher:

    http://concurrencyfreaks.blogspot.com/2017/08/why-is-memory-reclamation-so-important.html

    It says the following:

    "Atomic Reference Counting is just what the name says, it's a "reference counting" technique but with atomics. The details are a bit more tricky
    than your usual reference counting (aka smart pointers), but it's still graspable for most. They can be implemented in a wait-free way (in x86)
    but they have two main drawbacks: they're slow and they aren't
    universal. They're slow because whenever we have to traverse a list of
    nodes we need to atomically increment a counter in one node and
    decrement a counter in another... even though we're just reading."


    I think that this PhD researcher is not so smart, because
    look at my following invention of a Scalable reference counting
    that is Wait-free:

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

    My invention above is really powerful, and it is a proof that
    i am smart like a genius.


    Thank you,
    Amine Moulay Ramdane.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Wisdom91@21:1/5 to All on Tue Jul 14 09:37:32 2020
    On 7/13/2020 5:06 PM, Wisdom91 wrote:
    Hello,

    Read this:


    About why is memory reclamation so important?

    I am a white arab, and here is one more proof that i am
    smart like a genius:

    Read the following from a PhD researcher:

    http://concurrencyfreaks.blogspot.com/2017/08/why-is-memory-reclamation-so-important.html


    It says the following:

    "Atomic Reference Counting is just what the name says, it's a "reference counting" technique but with atomics. The details are a bit more tricky
    than your usual reference counting (aka smart pointers), but it's still graspable for most. They can be implemented in a wait-free way (in x86)
    but they have two main drawbacks: they're slow and they aren't
    universal. They're slow because whenever we have to traverse a list of
    nodes we need to atomically increment a counter in one node and
    decrement a counter in another... even though we're just reading."


    I think that this PhD researcher is not so smart, because
    look at my following invention of a Scalable reference counting
    that is Wait-free:

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


    My invention above is really powerful, and it is a proof that
    i am smart like a genius.


    Thank you,
    Amine Moulay Ramdane.



    Read this:

    https://groups.google.com/forum/#!topic/comp.programming.threads/F_cF4ft1Qic



    Thank you,
    Amine Moulay Ramdane.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)