Get the latest tech news
Conservative GC can be faster than precise GC
wingolog: article: conservative gc can be faster than precise gc
However the calculus is not as straightforward as most people think, and indeed there are some reasons to expect that conservative root-finding can result in faster systems. A compiler that does precise root-finding will typically output a side-table indicating which slots in a stack frame hold references to heap objects. This may lead to larger stack sizes than if you could just re-use a slot for two purposes, if the lifetimes don’t overlap.
Or read this on Hacker News