4 ms·
The BEAM GC algorithm is explained in details here: https://www.erlang-solutions.com/blog/erlang-garbage-collector.html https://www.erlang-solutions.com/blog/e
by ramchip 9y ago
The BEAM GC algorithm is explained in details here:
https://www.erlang-solutions.com/blog/erlang-garbage-collector.html https://www.erlang-solutions.com/blog/erlang-garbage-collect...
I think it’s moving, unless I misunderstood something?
- dfox 9y agoThat is why the "AFAIK" was there :) Few years ago I read some paper from Ericsson that described non-moving generational GC explicitly designed for Erlang's data model which could even be implemented in terms of malloc()/free(), I'm not sure that it was relevant to how it is implemented in current BEAM.
- ramchip 9y agoThat’s quite possible. The GC has changed several times. There was even a unified heap fork of Erlang at some point: https://www.researchgate.net/profile/Marc_Feeley/publication/2371933_A_Case_for_the_Unified_Heap_Approach_to_Erlang_Memory_Management/links/583c242908ae1ff45982a9d4/A-Case-for-the-Unified-Heap-Approach-to-Erlang-Memory-Management.pdf https://www.researchgate.net/profile/Marc_Feeley/publication...