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).
No, actually. Most of that speedup can come from a better runloop--python's core loop's rather inefficient. Full-on type inferencing and whatnot'd likely get you a larger speedup.
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.
__________________________________ Do you Yahoo!? New Yahoo! Photos - easier uploading and sharing. http://photos.yahoo.com/
--
Dan--------------------------------------"it's like this"-------------------
Dan Sugalski even samurai
[EMAIL PROTECTED] have teddy bears and even
teddy bears get drunk
