Jeronimo Pellegrini <j...@aleph0.info> 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?

-- 
Alex


_______________________________________________
Chicken-users mailing list
Chicken-users@nongnu.org
http://lists.nongnu.org/mailman/listinfo/chicken-users

Reply via email to