Most of the code I write is in a garbage collected language.
I'm often surprised how much extra performance I can get when I can control allocations. I saved ~10% runtime in difftastic by moving to a zero-allocation colour library (owo_colours)!
miniblog.
Related Posts
I've been tinkering with some garbage collection approaches for a toy language.
Comparing refcounting with mark-and-sweep, the latter seems less error-prone. 'Values in list X but not in Y' is less scary to implement than 'every incref should have a decref'. Agree/disagree?
The development of multicore Haskell, its runtime and garbage collector:
Exploring garbage collection accelerators in CPUs: https://spectrum.ieee.org/tech-talk/computing/hardware/this-little-device-relieves-a-cpu-from-its-garbage-collection-duties