I don't think that Dan meant that Python-on-Parrot would be 20x faster. He's saying that it's easy to speed up Python if you leave out the slow parts, and that the Python-on-.NET implementation has left out the slow parts so far. So when it's complete, Python-on-.NET will end up slower than "regular" Python. (That's my interpretation of what he's saying.)

JEff

On Dec 23, 2003, at 10:28 PM, Joe Wilson wrote:

In order to get the 20x speed gain you seek I assume
that Parrot would have to perform some sort of variable
type inference to distinguish, for example, when a
scalar is really just an integer and use an integer register.
Otherwise, the PMCs in Parrot would perform much the same
as the Python scalars (or whatever Python calls them).

The question is when would Parrot would perform this type
inference and subsequent bytecode transformation?  At bytecode
load time or at runtime?

--- Dan Sugalski <[EMAIL PROTECTED]> wrote:
Yeah, but alas Miguel's mis-informed. A reasonable reimplementation
of core python (without all the grotty bits that arguably throw in
the huge speed hit) should run that benchmark at about 20x python's
base speed, and the parts of Python that will give .NET serious fits
haven't been implemented. Python's method semantics don't match
.NET's semantics in a number of performance-unpleasant ways.



Reply via email to