News for hackers. Stuff that matters.
Re:Is reference counting slower than GC? by xxs on Tuesday May 24, 2016 @05:24AM (#11759999)
Atomic part has to notify the rest of caches to invalidate the cache line. Local latency in the best case.
Re:Is reference counting slower than GC? by gpderetta on Tuesday May 24, 2016 @05:30AM (#11760033)
FYI, any store has to invalidate remote cachelines, that's taken care by the coherence protocol even before the store is actually performed.

Memory barrier (and atomic operations) don't have anything to do with it.

Re:Is reference counting slower than GC? by JoachimSchipper on Tuesday May 24, 2016 @05:38AM (#11760060)
Whether stores invalidate remote cachelines depends entirely on the architecture. But yes, Intel has fairly strong coherency.
Re:Is reference counting slower than GC? by gpderetta on Tuesday May 24, 2016 @06:59AM (#11760431)
It seems to me that any cache coherent system needs to do that. If multiple writers can be updating a cacheline a the same time [1] you can't talk of coherency at all. Intel is stronger as it guarantees a total ordering of modifications across all cachelines, but any coherent system will guarantee the ordering of modification of a single cacheline.

[1] visibly at least. HTM complicates things a bit of course.

Re:Is reference counting slower than GC? by imtringued on Tuesday May 24, 2016 @05:31AM (#11760038)
So false sharing is the problem?
Re:Is reference counting slower than GC? by gpderetta on Tuesday May 24, 2016 @07:09AM (#11760505)
If the refcount is allocated in the same cacheline with the rest of the object, then false sharing is also a problem. But the violation of the single writer principle when updating refcounts is actually a form of true sharing.