Leopold Toetsch <[EMAIL PROTECTED]> wrote:
> As Nick seems to be hitting some limits, I've tried this:
> stuff a differing amount of PMCs into an Array and time a DOD run:
> $ parrot -j 10m.pasm
> create 1e+06 PerlInts 2.051168
> DOD sweeps: 21 one is 0.141291
> $ parrot -j 10m.pasm
> create
Leopold Toetsch <[EMAIL PROTECTED]> wrote:
> Dan Sugalski <[EMAIL PROTECTED]> wrote:
>> *) Lay in a generational garbage collector.
> Good for that degenerated case, probably, but see below.
A generational GC still has to mark the root set and the old
generation's objects. So it wouldn't be of a
Dan Sugalski <[EMAIL PROTECTED]> wrote:
> [Even worse number snipped]
> Yeah, you've hit the degenerate case. The current DOD system is
> geared towards a relatively small live set, and cases where we
> actually find garbage when we trace the live set. (This is a case
> where refcounting is the b
At 9:42 PM +0200 5/7/04, Leopold Toetsch wrote:
As Nick seems to be hitting some limits, I've tried this:
stuff a differing amount of PMCs into an Array and time a DOD run:
[Progressively nastier numbers snipped]
Athlon 800, optimized build. These 78 DOD runs all taking half a
second are of course
As Nick seems to be hitting some limits, I've tried this:
stuff a differing amount of PMCs into an Array and time a DOD run:
$ parrot -j 10m.pasm
create 10 PerlInts 0.064826
DOD sweeps: 4 one is0.013948
$ parrot -j 10m.pasm
create 50 PerlInts 0.698430
DOD sweeps: 12 one is 0.070052
