[plt-scheme] Has PLT performance improved?

From: Noel Welsh (noelwelsh at gmail.com)
Date: Thu Jul 2 12:21:11 EDT 2009

On Thu, Jul 2, 2009 at 5:10 PM, Eli Barzilay<eli at barzilay.org> wrote:
> On Jul  2, Philippos Apolinarius wrote:
>> I noticed also that PLT is not so good at array intensive
>> computations. In one of those Lisp benchmarks designed to show that
>> Lisp can be as fast as C, PLT (7.9s, without f64vector) is twice as
>> much time as Bigloo (4.3s, without f64vector). Does PLT team intends
>> to improve array processing?
> An `f64vector' stores the FP numbers in a C vector, which means that
> every access will create a Scheme floating point number -- so
> accessing the same places over and over means that you keep generating
> garbage for the GC.  Using a plain Scheme `vector' is likely to work
> better, and provide more chances for the compiler to better optimize
> the code.

My benchmarks, some time ago, showed vector about 10x faster than f64vector.


Posted on the users mailing list.