2009/3/13 Jon Harrop <jon@ffconsultancy.com>:
> On Sunday 08 March 2009 01:19:20 Jon Harrop wrote:
>> Well, I have my first working GC running in HLVM now! Woohoo!
>
> I have just updated HLVM's GC to use a hash table instead of a linear search
> of the allocated list. This brings GC time down from O(n^2) to amortized
> O(n). In practice, the benchmarks are up to 100x faster than they were and,
> in the worst case, HLVM is now only 5x slower than OCaml.

Keep up the good work.

I'm still a bit worried about that 60MB runtime though ...

Are you looking into trace trees for JIT?

Mikkel