A good benchmark for a garbage collector
Posted: Mon Feb 25, 2013 6:31 am
Hello.
I am currently experimenting with a few ideas on garbage collection, and I am looking for good benchmarks for them - algorithms that exhaust it, etc. One problem I see is that it is probably pointless to compare them to the widespread GCs. On the one hand, it is probably easy to top something like Boehm-Weiser, because it is optimized for working in a non-cooperative environment. On the other hand, the GCs of Lisp- and Haskell-Implementations are probably very sophisticated (generational, with a lot of heuristics and code optimization), while I just want to try out some ideas.
I am currently experimenting with a few ideas on garbage collection, and I am looking for good benchmarks for them - algorithms that exhaust it, etc. One problem I see is that it is probably pointless to compare them to the widespread GCs. On the one hand, it is probably easy to top something like Boehm-Weiser, because it is optimized for working in a non-cooperative environment. On the other hand, the GCs of Lisp- and Haskell-Implementations are probably very sophisticated (generational, with a lot of heuristics and code optimization), while I just want to try out some ideas.