News for hackers. Stuff that matters.
Re:Is reference counting slower than GC? by sklogic on Tuesday May 24, 2016 @05:13AM (#11759968)
Reference counting is never fast. Even on a single core.
Re:Is reference counting slower than GC? by chipsy on Tuesday May 24, 2016 @05:27AM (#11760017)
Don't describe it as "fast". Use "latency" or "throughput". RC is a useful building block for making real-time latency guarantees, and for many apps that is more important than peak throughput.
Re:Is reference counting slower than GC? by sklogic on Tuesday May 24, 2016 @05:30AM (#11760035)
It is really hard to get real time guarantees with RC - given that time for cleaning up depends on a size of a structure.

Just imagine it freeing a 10Gb linked list.

Real time pure mark and sweep GCs are easier.

Re:Is reference counting slower than GC? by NickPollard on Tuesday May 24, 2016 @05:53AM (#11760121)
You don't have to clean up everything at once - it's possible to put items on a queue to be cleaned up when refcounts hit zero, and you can then control at what rate the queue is emptied.
Re:Is reference counting slower than GC? by sklogic on Tuesday May 24, 2016 @06:08AM (#11760180)
Which makes it already far too complicated, more complex than a real time mark&sweep. Especially if there are loop checks - you cannot just empty the queue gradually, it's all or nothing.