3 ms·

I thought the concurrent GC algorithms (zing/azul, g1?) avoided these stop the world events by using concurrency?

• rchiang 5y ago
  This presentation from 2019 gives an idea about some of the GC avg/max runtimes using the NameNode: https://www.slideshare.net/xkrogen/hadoop-meetup-jan-2019-dynamometer-and-a-case-study-in-namenode-gc https://www.slideshare.net/xkrogen/hadoop-meetup-jan-2019-dy...
• dharmab 5y ago
  As discussed in the link, these algorithms reduce but do not entirely eliminate STW.
  • _old_dude_ 5y ago
    Recent GC algorithms slow down the application, either by not scheduling coroutines that allocate too much memory or by forcing them to do the marking or the evacuation (helping the GC) when running (or both). With that, STW pause time does not depend on the heap size or on the root set size (the stack size). In practice, it means pause < 1ms, at that point the OS becomes the bottleneck, not the GC. So latency is good but throughput can be reduced by 30%.