Re:Reclaiming C++ Data Structures with Cycles
by paulsutter on Thursday October 13, 2016 @05:25PM
(#12704169)
> This just isn't true anymore. Incremental collectors can achieve pause times in the single-digit millisecond range
Single digit milliseconds is millions of instructions, which /is/ a large slowdown in some applications.
Re:Reclaiming C++ Data Structures with Cycles
by titzer on Friday October 14, 2016 @02:40AM
(#12706465)
How much do you think a page fault costs?
Re:Reclaiming C++ Data Structures with Cycles
by paulsutter on Friday October 14, 2016 @03:29AM
(#12706598)
Page faults cost zero. On locked pages.
This just isn't true anymore. Incremental collectors can achieve pause times in the single-digit millisecond range, and concurrent collectors can achieve pause times in the single-digit to tens of microseconds range, even for super-high-allocation rate programs. There are even real-time collectors suitable for audio and other hard real-time applications.
Azul GC (a high performance concurrent compacting collector): https://www.azul.com/products/zing/pgc/
Metronome (a real-time GC with guaranteed maximum pause times): http://researcher.watson.ibm.com/researcher/view_group_subpa...
GC scheduling in V8 (hides GC pause times between frames, reducing animation jank): http://queue.acm.org/detail.cfm?id=2977741
The Go GC ships now with a very low-latency GC: https://blog.golang.org/go15gc