- jmerelo666 wrote:
>Firefox's Spidermonkey does have bytecode representation, but it doesn't
> Interpreted JS is not to slow, and, in fact, I would expect some kind
> of pre-compliation to a bytecode (similar to Java) actually happening
> in most browsers.
have just in time compiler (JIT) as a Java virtual machine will in most
That's what Tamarin is supposed to add to Firefox.
Another platform to think about is Silverlight (and Mono's Moonlight).
There the bytecode will be JIT'ed CIL with extensions for dynamic languages.
- It has been my experience (in various optimized code I write) that
compared to Java, and ignoring startup time:
- Well-optimized scheme is about 5 times slower at best. Actually
I've found hand-hacked Kawa to be fastest for stuff I do (about 2x
slower) as it has options to add explicit typing.
- Python is almost exactly 10 times slower, except when I customize
it for certain applications by dropping down to C (or when Numerical
Python is (rarely) helpful). psyco only helps a little bit.
- Ruby is 30 about times slower
I still use dynamic languages for lots of stuff. They're extremely
convenient tools for the right purposes. But if efficiency is your
primary goal (as is often the case in GP evaluations), you might wish
to look elsewhere.
- I still believe in Parrot VM (register-based virtual machine)
It is not optimized well yet.
Some old benchmarks (Parrot 0.4.6, August 9, 2006):
parrot-lgp (linear genetic programming implementation for Parrot virtual
machine) is optimized for fun (-Ofun) now :-).
Some interesting notes about Parrot VM:
* Loadable opcode libraries
* All those opcodes
* Fast interpretation
* another Perl 6 and Parrot links
S pozdravem Michal Jurosz
- Here's a new document on the Tamarin instruction set...
- --- In firstname.lastname@example.org, "Marcus G. Daniels"
>plz send me some matlab coding regarding to constrained optimisation
> Here's a new document on the Tamarin instruction set...
>plz help me in constrained optimisation using ga