On Mon, Jul 25, 2005 at 10:33:37PM -0400, Bob Rogers wrote:
[snip]
>
> This is sounding more and more like the CMUCL gencgc algorithm, which
> uses what I understand is a classic approach. Instead of an IGP list,
> it write-protects all oldspace pages (hence my earlier question),
> unprotecting t
are in an interpreter for a general-
purpose programming language is hard. I'd recommend against special
cases in the registers, since it's not clear how much they'd help.
--
Ed Mooring ([EMAIL PROTECTED])
initialization as each opcode was entered, and that devious/clever
data structure design could avoid most of this. Also, opcode dispatch
might not be the right tree up which to be barking in seeking performance.
--
Ed Mooring ([EMAIL PROTECTED])
en I tried checking some of my results on platforms other than Sparc,
Adding x86 and PowerPC made it even more confusing. I got about the
same 15% variation in random directions in more code.
Benchmarking complex programs on multiple platforms is hard. When
the complex program is a programming language itself, it's really
hard.
--
Ed Mooring ([EMAIL PROTECTED])
the top few entries:
Nope. It looks close to what I saw when I profiled perl 5.004 and 5.005
running over innlog.pl and cleanfeed. The only difference is the method
stuff, since neither of those were OO apps. The current Perl seems to
spend most of its time in the op dispatch loop and in dea
peed on SunOS and
Solaris (at least in my experiments). Not what I'd call really slow, but
we've complained vigorously about smaller slowdowns.
--
Ed Mooring
