This page maintains data on previous winners in
competitions at McGill
and Aarhus. It has not been updated since 2001, but the results of
the 2008 peephole contest will be posted here.
Previous WinnersFall 1997 (Aarhus): Mads Johan Jurik, Jørgen Ibsen and Results on Fall 2001 McGill BenchmarksCompiler Total Results on Fall 2000 McGill BenchmarksCompiler Total Results on Fall 1999 McGill BenchmarksCompiler Total Total Results on Winter 1999 McGill BenchmarksCompiler Total Total Reports on Previous CompetitionsResults of Fall 1997 Competition at AarhusThe following graph shows the combined results for all project groups (sorted by total number of bytecode instructions) for the Fall '97 class at University of Aarhus. Can McGill beat them?The winning group (16) reduced the combined code size from
21686
to 14851 bytecodes, an improvement of 32%. Fully half of the project
groups did better than the A+ compiler, and a
third did better than SUNs
|
Results of Winter 1998 Competition at McGill
Results of the Fall 1998 Competition at AarhusThe Danes won back the peephole title after some very strong peephole optimizers were developed. Thus, the challenge for the McGill Winter 1999 class is to reclaim the title.The best group beat javac 1.1.5, and four groups beat last year's winner. Results of the Fall 1999 Competition at McGillFor the first time the groups were provided with scripts for running their benchmarks and counting number of bytes and instructions. On the Fall 1999 McGill Benchmarks the winning group beat javac . Six of
the eight groups beat the A+ patterns. Here are the results:
#bytes #instr Note that the patterns labelled |
Maintained by Eric Bodden. [HOME] |