News for hackers. Stuff that matters.

A comment on Allocation is cheap in .NET until it is not. Parent comment

Re:Allocation is cheap in .NET until it is not by ramchip on Wednesday January 24, 2018 @07:15PM (#16227613)
The BEAM GC algorithm is explained in details here:

https://www.erlang-solutions.com/blog/erlang-garbage-collect...

I think it’s moving, unless I misunderstood something?

[ Parent | on HN ]
Re:Allocation is cheap in .NET until it is not by dfox on Wednesday January 24, 2018 @08:03PM (#16227888)
That 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.

[ Parent | on HN ]
Re:Allocation is cheap in .NET until it is not by ramchip on Wednesday January 24, 2018 @10:23PM (#16228512)
That’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...
[ Parent | on HN ]