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. -- Dr Jon Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com/?e _______________________________________________ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
