From: Dan Leslie d...@ironoxide.ca
Subject: [Chicken-hackers] Any thoughts on performance woes?
Date: Mon, 06 Apr 2015 22:28:49 -0700
A discussion has been raised on comp.lang.scheme regarding a simple
raytracer and the performance it poses in various schemes. In this,
Gauche an Racket
Or maybe there's some small mistake in our implementation that causes
it to retain too much data. I'm not sure of course, just theorizing,
because even though it generates a lot of garbage, my gut says it
shouldn't need this many major collections. But my gut has been wrong
often enough ;)
* Felix Winkelmann felix.winkelm...@bevuta.com [150407 10:41]:
But I'm sick and tired of people throwing badly written code into the
net and making gross assumptions about implementation performance. The
possible options, the search-space available is massive and a little
difference in
* Felix Winkelmann felix.winkelm...@bevuta.com [150407 09:44]:
This is a terribly written program. It uses 3-element lists as vectors
(including higher-order vector arithmetic using map) and allocates
like hell. The compiler can not do much with this code, and it
produces CPS calls everywhere.
I just had this crazy idea of new tooling that would help the curious
programmer to find the line of code that triggers a lot of allocation,
or find the line of code that causes a lot of GCs.
One could extend the profiling machinery to also trace and count
allocations (the compiler already
Felix Winkelmann scripsit:
That there are so many implementors in the Lisp and Scheme community
probably makes this irrational emphasis on (execution-time)
performance so apparent in these groups. Or it's the remains of the
trauma of the AI-Winter, I don't know (and I don't care anymore.)
I
Hi,
On Tue, 7 Apr 2015 11:32:39 +0200 Peter Bex pe...@more-magic.net wrote:
If anyone wants to add it to the chicken-benchmark repo, I would
recommend removing the writing of the output file, as that's really
not where the bottleneck is, and writing a file isn't very nice in a
benchmark
On Tue, Apr 07, 2015 at 12:35:38PM +, Mario Domenech Goulart wrote:
Hi,
On Tue, 7 Apr 2015 11:32:39 +0200 Peter Bex pe...@more-magic.net wrote:
If anyone wants to add it to the chicken-benchmark repo, I would
recommend removing the writing of the output file, as that's really
not
Felix Winkelmann felix.winkelm...@bevuta.com writes:
This is a terribly written program. It uses 3-element lists as vectors
(including higher-order vector arithmetic using map) and allocates
like hell. The compiler can not do much with this code, and it
produces CPS calls everywhere.
I take
Peter Bex pe...@more-magic.net writes:
I have a solution in the works for the particular problem of slow
numbers. This is in a CHICKEN 5 branch I've been working on, which
I will announce in a week or so.
Colour me excited. :)
-Dan
--
-Dan Leslie
Felix Winkelmann felix.winkelm...@bevuta.com writes:
I'm a compiler-writer, my job is to be paranoid about performance.
But otherwise raw speed is in most cases secondary (try to run large
real-world programs on Larceny or Stalin and you know what I mean.)
That there are so many implementors
11 matches
Mail list logo
