Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
About why is memory reclamation so important?
21 views
Skip to first unread message
amin...@gmail.com
Jul 13, 2020, 5:08:32 PM7/13/20
to
Hello,
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.
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.
Chris M. Thomasson
Jul 13, 2020, 5:11:56 PM7/13/20
to
On 7/13/2020 2:08 PM, amin...@gmail.com wrote:
> Hello,
>
>
> 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 don't think you understand what atomic reference counting can be.
> Hello,
>
>
> 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."
There are many flavors. Check this out for fun:
https://patents.google.com/patent/US5295262
Btw, have you ever heard of proxy reference counting? Each node does not
need a counter.
amin...@gmail.com
Jul 13, 2020, 7:33:27 PM7/13/20
to
amin...@gmail.com
Jul 13, 2020, 7:34:34 PM7/13/20
to
On Monday, July 13, 2020 at 5:11:56 PM UTC-4, Chris M. Thomasson wrote:
https://groups.google.com/forum/#!topic/comp.programming.threads/F_cF4ft1Qic
Chris M. Thomasson
Jul 13, 2020, 7:37:38 PM7/13/20
to
garbage collection. Why? Who told you that?
0 new messages