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
-
Show this thread
-
Replying to @whitequark
http://golang.org/s/gctoc prototype wasn’t clearly better than baseline
1 reply 1 retweet 8 likes -
-
Replying to @whitequark
some discussion here: https://blog.golang.org/ismmkeynote
1 reply 1 retweet 6 likes -
Replying to @davidcrawshaw
interesting. i wonder if the results would be different with a moving collector
1 reply 0 retweets 2 likes -
Replying to @whitequark @davidcrawshaw
Came here to say this. The Go experience isn’t very representative because they didn’t implement bump allocation in the nursery.
3 replies 1 retweet 8 likes -
Replying to @pcwalton @davidcrawshaw
that, plus if you are moving objects, then a generation check is basically masking a pointer, right?
1 reply 0 retweets 2 likes
Replying to @whitequark @davidcrawshaw
Depends on how you implement it, but yeah.
5:18 PM - 17 Apr 2020
0 replies
0 retweets
3 likes
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.