> While not always the case, it is often the case that a good GC will beat all of those. A generational copying GC with parallel collection will treat most allo

> While not always the case, it is often the case that a good GC will beat all of those. A generational copying GC with parallel collection will treat most allocations as pointer bumps. Giving them the speed of a bump allocator with periodic fragmentation fixes when collection happens. It will beat both slab and arena allocators. Unfortunately Go's allocator is none of those. It has slow allocation performance because they don't do generational GC.