On Sun, Oct 11, 2009 at 11:53:35AM +0900, Alex Shinn wrote: > Jeronimo Pellegrini <[email protected]> writes: > > > I have written a program that repeatedly multiply matrices as a > > very simplistic benchmark (because it is the kind of thing I'd like > > to do very fast). The result was: > > > > bigloo 0.52s > > gambit 2.70s > > chicken 8.70s > > > > This is for compiled Scheme, with all possible optimizations turned > > on. > > Can we see the code and optimization settings you used?
Sure! http://aleph0.info/scheme/ The times I listed before are for 100000 repetitions on small matrices (3x4, 4x6), so as to alsoinclude function call overhead in the benchmark. I have uploaded two 100x100 random matrices also, and the results for 20 repetitions on them (results.txt). I understand that micro-benchmarks like this are usually not significative, but in this case they make some sense, since it's the kind of thing my programs will do most of the time. J. _______________________________________________ Chicken-users mailing list [email protected] http://lists.nongnu.org/mailman/listinfo/chicken-users
