On Mon, Apr 14, 2008 at 10:07:14AM +0100, Alberto Simoes wrote:
> Bob Rogers wrote:
> > From: Alberto Simoes <[EMAIL PROTECTED]>
> > >3. A semi-log plot would be easier to interpret.
> >
> > Smash tried a log plot, but it wasn't easier to interpret. I am not
> > sure what is a semi-log
Bob Rogers wrote:
From: Alberto Simoes <[EMAIL PROTECTED]>
Date: Sun, 13 Apr 2008 19:16:39 +0100
This is my fault. I prefer smooth curves.
But I think smash can include the gplot data together with the source code.
That would be ideal.
>3. A semi-log plot would be easier
On Sun, 2008-04-13 at 14:35 -0700, chromatic wrote:
> As well, the optimizations I recommend for Parrot (if you want to use
> optimization flags) are:
>
> -O2, to choose the fastest available runcore
Not so, unless this has been fixed without resolving the RT bug:
http://rt.perl.org/rt3//
From: Alberto Simoes <[EMAIL PROTECTED]>
Date: Sun, 13 Apr 2008 19:16:39 +0100
This is my fault. I prefer smooth curves.
But I think smash can include the gplot data together with the source code.
That would be ideal.
>3. A semi-log plot would be easier to interpret.
Smas
Bob Rogers wrote:
From: "Nuno 'smash' Carvalho" <[EMAIL PROTECTED]>
Date: Sun, 13 Apr 2008 18:57:26 +0100
Greetings all,
We did another Parrot benchmarking, this time using a common
programming technique: recursion. We created a function to calculate
the number of nodes in a
From: chromatic <[EMAIL PROTECTED]>
Date: Sun, 13 Apr 2008 14:35:11 -0700
. . .
If they're stable (and they're not always perfectly stable), -Oc should
improve the recursion benchmark.
-- c
AFAICS, there are no calls in tail position, and hence no opportunity
for tailcall opt
On Sunday 13 April 2008 10:57:26 Nuno 'smash' Carvalho wrote:
> We did another Parrot benchmarking, this time using a common
> programming technique: recursion. We created a function to calculate
> the number of nodes in a full binary tree given the tree's height. I
> guess this time the results
On Sun, Apr 13, 2008 at 07:21:06PM +0100, Nuno 'smash' Carvalho wrote:
> On Sun, Apr 13, 2008 at 7:06 PM, Patrick R. Michaud <[EMAIL PROTECTED]> wrote:
> >
> > On Sun, Apr 13, 2008 at 06:57:26PM +0100, Nuno 'smash' Carvalho wrote:
> > > Greetings all,
> > >
> > > We did another Parrot benchmark
On Sun, Apr 13, 2008 at 7:13 PM, Bob Rogers
<[EMAIL PROTECTED]> wrote:
>From: "Nuno 'smash' Carvalho" <[EMAIL PROTECTED]>
>Date: Sun, 13 Apr 2008 18:57:26 +0100
>
>
>
>Greetings all,
>
> We did another Parrot benchmarking, this time using a common
>programming technique: recursi
On Sun, Apr 13, 2008 at 7:06 PM, Patrick R. Michaud <[EMAIL PROTECTED]> wrote:
>
> On Sun, Apr 13, 2008 at 06:57:26PM +0100, Nuno 'smash' Carvalho wrote:
> > Greetings all,
> >
> > We did another Parrot benchmarking, this time using a common
> > programming technique: recursion. We created a f
On Sun, Apr 13, 2008 at 06:57:26PM +0100, Nuno 'smash' Carvalho wrote:
> Greetings all,
>
> We did another Parrot benchmarking, this time using a common
> programming technique: recursion. We created a function to calculate
> the number of nodes in a full binary tree given the tree's height. I
>
11 matches
Mail list logo
