[Larceny-users] running fasl's

[William D Clinger]

Marijn reported that Gambit is about 3 times as fast as
the current development version of Larceny "for the same
run (1000 cluster flips per site with the Wolff algorithm
on a 40x40 grid)."

In general, Gambit should be about 3 times as fast as
Larceny on floating point computations.  The reason is
that Gambit's compiler tries to generate code for unboxed
flonums.  Larceny does not yet do that, and the cost of
boxing every flonum turns out to be a factor of 3 on IA32
machines.

Before v0.97a4, Larceny had some additional inefficiency
caused by two longjmp operations on the millicode path
used by mixed-mode arithmetic and by a few operations such
as inexact->exact.  Removing those longjmp operations made
that millicode path over 10 times as fast.

Will