has anyone made a webserver in a language with a generational GC where the young generation is per-request, i.e. you have many minor heaps? seems like it would make latency a lot more deterministic without impacting things like in-process caches
-
-
that, plus if you are moving objects, then a generation check is basically masking a pointer, right?
-
Depends on how you implement it, but yeah.
End of conversation
New conversation -
-
-
Do you know of a good example of generational collector which compares bump allocation vs freelist? The mimalloc paper reckons having both isn’t worth the extra branches in the allocation path.
-
JSC has both but their presentations/blog reckons you make it up by avoiding building a freelist for empty pages.
- 4 more replies
New conversation -
-
-
Very misleading claim. Allocation is not a hotspot in Go so making it faster wouldn’t help.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
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.