[gambit-list] Help With Memory
Bradley Lucier
lucier at math.purdue.edu
Thu Sep 25 22:46:42 EDT 2008
On Sep 25, 2008, at 10:21 PM, Alex Shinn wrote:
>
> Marc Feeley <feeley at iro.umontreal.ca> writes:
>
>> Gambit does not use Cheney on the MTA, mainly because it interferes
>> with the implementation of unrestricted calls from Scheme to C and
>> from C to Scheme. Gambit's implementation of continuations is done
>> with a lazy copy of the captured continuation. The performance is
>> quite good... on the two call/cc intensive Gambit benchmarks (ctak
>> and
>> fibc) Gambit outperforms Chicken.
>
> Really? This page
>
> http://www.ccs.neu.edu/home/will/Twobit/benchmarksFakeR6Linux.html
>
> shows Chicken outperforming Gambit on ctak (it doesn't have
> fibc).
It has fibc (gambit code runs faster than chicken code).
More information about the Gambit-list
mailing list