Golang’s Real-Time GC in Theory and Practice
The weak generational hypothesis states that most objects are short-lived. Therefore concentrating on collecting the youngest objects yields the most garbage/cpu cycle spent.<p>In the benchmark, all objects survive the same amount of time and it is the oldest objects that become garbage first. It is the opposite of the behavior the weak generational hypothesis presumes. So collectors optimized for that scenario is at a disadvantage. :)<p>For example, I ported the benchmark to Python 3 and got a max pause time of 0.05 ms. That's 40 times faster than OCaml but it doesn't mean Python is faster in general. It just "got lucky" because ref counting is an almost optimal fit for the benchmark. There is no strategy that fits all when it comes to memory management. :)