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.
It's still rather interesting that Racket and even Gauche
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
On Tue, Apr 07, 2015 at 09:43:55AM +0200, Felix Winkelmann wrote:
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 outperform Chicken, and Racket does so
resoundingly. To be frank, it
On Tue, Apr 07, 2015 at 10:41:32AM +0200, Felix Winkelmann wrote:
Indeed, I was not trying to make it look otherwise. Apparently Flatt
and Kawei did an excellent job in optimizing their implementations, no
doubt about that.
Or maybe there's some small mistake in our implementation that causes
On Tue, Apr 07, 2015 at 11:32:39AM +0200, Peter Bex wrote:
On Tue, Apr 07, 2015 at 10:41:32AM +0200, Felix Winkelmann wrote:
Indeed, I was not trying to make it look otherwise. Apparently Flatt
and Kawei did an excellent job in optimizing their implementations, no
doubt about that.
I tried
* 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.
* 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
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
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
On Tue, 7 Apr 2015 14:43:42 +0200 Peter Bex pe...@more-magic.net wrote:
On Tue, Apr 07, 2015 at 12:35:38PM +, Mario Domenech Goulart wrote:
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
On Tue, Apr 7, 2015 at 7:00 AM, chicken-users-requ...@nongnu.org wrote:
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
On Tue, Apr 07, 2015 at 09:33:49AM -0400, F. Rafael Leon wrote:
Even when editing the C code, I wrap it in chicken and dynamically
load it over and over again as I refine the inner loop.
Hey, that sounds interesting! How do you do that?
No implementation is as fast as 10 lines of
Hi Dan,
On Tue, 07 Apr 2015 09:34:12 -0700 Dan Leslie d...@ironoxide.ca wrote:
Perhaps it's because of the industries in which I've worked (gaming,
embedded systems and enterprise SaaS), but I've not really experienced
development where performance wasn't a top or near-top priority. Part of
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
On Tue, Apr 7, 2015 at 9:48 AM, Peter Bex pe...@more-magic.net wrote:
Even when editing the C code, I wrap it in chicken and dynamically
load it over and over again as I refine the inner loop.
Hey, that sounds interesting! How do you do that?
This is a whole different topic from the
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
17 matches
Mail list logo
