On Feb 22, 2008, at 4:40 PM, Guillaume Cartier wrote:
Did you do some tests on code size too? We have to be carefull about that too as Gambit is already fairly bloated when it comes to generated code size.
On Fri, Feb 22, 2008 at 3:12 PM, Bradley Lucier lucier@math.purdue.edu wrote:
It cuts about 5% off some benchmarks.
It reduces code size because it gets rid of POLLs in some tight loops in Gambit's runtime library. It has no effect on the size of user- compiled code. If you want to make the gambit runtime smaller, I suggest
(##define-macro (use-fast-bignum-algorithms) #f)
in lib/_num.scm and then stripping the executables.
As to Christian's comments about unresponsiveness---there are already many tight loops in the gambit runtime that disable interrupts to gain performance. I think if you want to throw around strings that are hundreds of megabytes long then you are willing to accepts some unresponsiveness.
Brad