Re: Supercompiled Perl: HP's Dynamo Project

On Fri, Aug 10, 2001 at 07:11:19PM -0500, Rick Rankin wrote:

[...]

> "Dynamic optimization refers to the runtime optimization of a native

Runtime... optimizing...

> program binary. This paper describes the design and implementation
> of Dynamo, a prototype dynamic optimizer that is capable of
> optimizing a native program binary at runtime.

[...]

> Dynamo observes the program's behavior through interpretation to
> dynamically select hot instruction traces from the

... interpreter... selecting hot instructions...

> running program. The hot traces are optimized using low-overhead
> optimization techniques and emitted into a software code

... and rewriting them...

> cache. Subsequent instances of these traces cause the cached version
> to be executed, resulting in a performance boost.

... faster?

[...]

> Transparent Dynamic Optimization;Vasanth Bala, Evelyn Duesterwald,
> Sanjeev Banerjia;HP Laboratories Cambridge;June, 1999

Can we make perl do this?  Even as an experimental add-on module using
B:: something, asynchronous callbacks, and maybe threads?  Could it be
extended to the point where it eats hot running bytecode and excretes
native machine instructions in its place?

Sincerely, your man in the field (the Hubble Deep Field, it would
seem),

-- Rocco Caputo / [email protected] / poe.perl.org / poe.sourceforge.net