3 ms·

The JVM has several different types of GC algorithms, many of which are tunable. (A better place to look to understand GC might actually be LuaJIT or Erlang. I

The JVM has several different types of GC algorithms, many of which are tunable. (A better place to look to understand GC might actually be LuaJIT or Erlang. I say "might" because while I've been told that both have simple to understand implementations, I have not bothered myself to actually look at them.)

rudolf0 12y ago
Isn't LuaJIT's GC not that robust? I believe Mike Pall has lamented it as being the worst part of the compiler. I think he's wanted to rewrite it from scratch for a while, but doesn't yet have the time or resources.
- nickik 12y ago
  He is working on it: http://wiki.luajit.org/New-Garbage-Collector http://wiki.luajit.org/New-Garbage-Collector
  - rudolf0 12y ago
    Mike last updated that page in 2012, and I'm not sure if he's publicly committed any code for it. I seem to recall him requesting a sponsorship for it.
felixgallo 12y ago
Erlang is mostly an immutable functional language without pointers, so for most scenarios not involving large binaries, its GC is completely trivial. For large binaries, a relatively primitive reference counting system is used. If I were to study GC from scratch, I'd start with http://www.hboehm.info/gc/ http://www.hboehm.info/gc/.