Here’s a great article on Read-Copy-Update that goes into the magic of Linux sys_membarrier and Windows FlushProcessWriteBuffers for not only lock-free but even atomic-free “highly asymmetric synchronization” as is needed for garbage collectors.
On Intel, the mutator doesn’t even need to use atomics. The question I haven’t answered yet is whether performance goes to hell on ARM or if those super expensive fences can be avoided.
-
-
So let me understand better: under your scheme, is it possible to move objects in memory (eg to compact all older generation objects together) by mutating the pointer? As for ARM, if you want to bruteforce-test an assumption, there's an ARM Linux machine at my desk you can use.
-
Immutable objects can be relocated. Relocating mutables would require one of several forms of extreme overhead. This is an okay tradeoff in my design because most short-lived objects are collections, which use shallow-copyable immutable data structures.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.