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

Groups > comp.programming > #8744

Is reference counting slower than GC?

Show all headers | View raw

Hello,


Is reference counting slower than GC?

I think that this Java and other garbage collected interpreters and
compilers are not general purpose, read for example this:


"Total memory matters

GC tends to result in more memory being used in total. The trigger for 
scanning is often low memory conditions, meaning that a lot of memory 
needs to be allocated prior to a scanning operation. This has 
significant OS level implications: memory used by the app must be 
swapped in/out, and also prevents other apps, and file caches, from 
using the memory.

It’s my feeling, from experience, that it’s this aspect of GC’d 
applications that cause the biggest performance impact. The overall 
system just goes slower due to the large amount of memory involved. It 
doesn’t seem like it needs to be a fundamental problem of a GC though. 
The structure of a standard library, and typical programming paradigms, 
contributes a lot to this effect."


Read more here:

https://mortoray.com/2016/05/24/is-reference-counting-slower-than-gc/




Thank you,
Amine Moulay Ramdane.

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

Thread

Is reference counting slower than GC? Sky89 <Sky89@sky68.com> - 2018-05-02 16:15 -0400

csiph-web