A good benchmark for a garbage collector

Whatever is on your mind, whether Lisp related or not.
Post Reply
schoppenhauer
Posts: 99
Joined: Sat Jul 26, 2008 2:30 pm
Location: Germany
Contact:

A good benchmark for a garbage collector

Post by schoppenhauer » 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.
Sorry for my bad english.
Visit my blog http://blog.uxul.de/

nuntius
Posts: 538
Joined: Sat Aug 09, 2008 10:44 am
Location: Newton, MA

Re: A good benchmark for a garbage collector

Post by nuntius » Mon Feb 25, 2013 10:32 am

"The right" benchmark depends a lot on what you are trying to investigate. Where do you expect your algorithm to excel or fall behind -- those areas may need a special test. They may even need a particular programming style.

See for example the old CL FAQ discussion on cdr-coding.
http://www.faqs.org/faqs/lisp-faq/part2/section-9.html


Here are some lispy benchmarks to consider.

http://common-lisp.net/project/cl-bench/
http://www.hpl.hp.com/personal/Hans_Boe ... bench.html
http://www.cesura17.net/~will/Professio ... ecode.html

Many more can be found by searching for things like "gc benchmark".

nuntius
Posts: 538
Joined: Sat Aug 09, 2008 10:44 am
Location: Newton, MA

Re: A good benchmark for a garbage collector

Post by nuntius » Wed Mar 13, 2013 12:35 pm

Here are a couple Java benchmarks that may be useful.

http://dacapobench.org/
http://www.spec.org/jvm2008/

Post Reply