Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming.threads > #5907 > unrolled thread

About why is memory reclamation so important?

Back to article view | Back to comp.programming.threads

Contents

  About why is memory reclamation so important? aminer68@gmail.com - 2020-07-13 14:09 -0700
    Re: About why is memory reclamation so important? aminer68@gmail.com - 2020-07-13 16:39 -0700

#5907 — About why is memory reclamation so important?

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.

[toc] | [next] | [standalone]

#5908

On Monday, July 13, 2020 at 5:09:17 PM UTC-4, 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 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.

[toc] | [prev] | [standalone]

Back to top | Article view | comp.programming.threads

csiph-web