Chris Vine <ch...@cvine.freeserve.co.uk> writes: > No, on my Haswell laptop running 64-bit linux, solving the 40,000th > prime (479909) is 1.26 times faster in chez scheme than in guile-2.1.7, > on the simple algorithm. (0.509 seconds versus 0.624 seconds, on a > i7-4712HQ CPU @ 2.30GHz.) This is only the time taken in the body of > the calculation. Start-up times and printing times and so forth are > ignored.
Ah, ok. Thank you! > I have just tried out the same code on an older Sandybridge desktop > @3.30 GHz running 32-bit linux which I can access remotely, and that had > chez scheme 1.7 times faster than guile-2.1.7 so it looks to be > somewhat CPU and/or cache and/or pointer-width sensitive. Anyway, it is > just one benchmark. > > I think I am about schemed out so installing Stalin is probably not an > option. Like you, I am told it is fast. Guile's selling point IMO is > its libraries and its FFI. Guile 2.2 certainly seems adequately fast > at run time. Possibly compile times may be an issue, I don't know. Factor 10 between C++ and pure Scheme is pretty awesome. Implementing algorithms in pure Python carries a penalty of easily factor 100 (though delegating anything expensive to builtin operators is fast). Best wishes, Arne -- Unpolitisch sein heißt politisch sein ohne es zu merken
signature.asc
Description: PGP signature
