[ Content | View menu ]

Erlang Garbage Collection

Mark Mzyk | March 30, 2008

When I asked the question about how Erlang Garbage Collection works, I expected that because of Erlang’s focus on concurrency its garbage collection algorithm would be incredibly complicated.

I was wrong.  Turns out, it’s rather simple as far as garbage collection algorithms go, thanks in large part to how Erlang uses processes.

Filed in: Languages.

One Comment

  1. Comment by Luke Hoersten:

    From what I’ve heard, Erlang intentionally doesn’t over-optimize the compiler or runtime to really drive home how large the scalar value of scaling wide can be. Runtime speed doesn’t matter when you have a ton of machines =)

    April 7, 2008 @ 03:15