I recently posted a problem using big numbers that ran quite a bit slower than
the current Racket. Peter Bex supplied 2 patches that were a great improvement.
While trying to increase the speed I used the csc option -heap-size 1000M
where I varied the size from 1000M to 1M. I have 32 GB o
With patch 0001 the elapsed time went from 33.7 seconds to 24.5 seconds.
With patch 0002 the elapsed time went to 23.4 seconds.
Good work -- Doug
On Wednesday, May 22, 2024 at 08:54:49 AM MDT, Peter Bex
wrote:
On Wed, May 22, 2024 at 02:42:38PM +0200, Peter Bex wrote:
> Attached are two
Hello Mario,
Yes, please add the program to the chicken-benchmarks.
Regards,Doug
On Wednesday, May 22, 2024 at 12:50:56 PM MDT, Mario Domenech Goulart
wrote:
Hi Doug,
On Tue, 21 May 2024 21:35:33 + (UTC) "T.D. Telford"
wrote:
> Thanks for the reply. The elapsed ti
Hello Peter,
I should have mentioned that I am using linux mint 21.3
Regards,Doug
(display "factor n = ") (display n) (newline) (time (rho n u v c iter prod)))
;;;
On Tuesday, May 21, 2024 at 12:13:55 AM MDT, Peter Bex
wrote:
(sending again, forgot to CC the users list)
On Mo
With the csc compiler and the -f or -fixnum-arithmetic option (Assume all
numbers are fixnums) my benchmarks appear to be quite fast compared to racket
of chez scheme. When running a benchmark that uses big integers (such as the
pollard rho), execution times are almost twice as long as racket o
