Leandro Lucarella: > Hello. I'm trying to make a benchmark suite to evaluate different GC > implementations. I'm looking for trivial benchmarks and full real-life > programs. If you have something like that or if you are interested in more > details about what I'm looking for, please read the following link:
This topic was discussed more than one time by me too. A gentle person here even has written a patch for the GC to solve one of the performance problems I did find (I think such patch was never accepted, I don't know why). I think D deserves a benchmark suite to test "everything". Haskell implementations have several of them. Inside here you can find 3 tests of the GC (gc1, gc2 and gc3) (one of them is the binary tree test you already have seen many times): http://www.fantascienza.net/leonardo/js/slow_d.zip Thy are tiny programs: I think a test suite has to contain both tiny and longhish programs, because the shorter ones are able to spot troubles in a more definite way, and the longer ones are able to spot less specific troubles. (The gc1 benchmark is the one partially fixed by that GC patch). Bye, bearophile
