[Ecls-list] Changes in sequences

[Gabriel Dos Reis]

On Mon, May 24, 2010 at 9:58 AM, Juan Jose Garcia-Ripoll
<juanjose.garciaripoll at googlemail.com> wrote:
> On Mon, May 24, 2010 at 4:53 PM, Julian Stecklina <js at alien8.de> wrote:
>>
>> Juan Jose Garcia-Ripoll
>> <juanjose.garciaripoll at googlemail.com> writes:> platform / time (seconds)
>> >         CASE 1   CASE 2   CASE 3
>> > ECL/32  2.586    2.531    8.841
>> > ECL/64  0.880    0.880    2.930
>>
>> Do you have an explanation why the 64-bit version is so much faster?
>
> No :-)  The garbage collector is really more efficient when using 64-bit
> pointers, but that should not be the only explanation, specially when the
> speedup happens also for the routines that do not cons (1 and 2).

this begs a question I have had a for a while:  Is there anything that
can be done
to improve ECL's performance on programs that cons a lot? (e.g. OpenAxiom)