Re:Building even faster interpreters in Rust
by unnouinceput on Friday September 25, 2020 @07:36PM
(#24595131)
Please show me just one example of such an interpreter. You chose the architecture and the operating system. I'll follow up with a C compiled native and see who's faster at doing the same thing.
Re:Building even faster interpreters in Rust
by voldacar on Friday September 25, 2020 @09:11PM
(#24595605)
Synthesis kernel by massalin comes to mind. not sure if there is a modern equivalent. pretty sure lisp systems like SBCL can do things like function specialization and loop unrolling at runtime but I haven't tried.
Re:Building even faster interpreters in Rust
by unnouinceput on Saturday September 26, 2020 @04:41AM
(#24597322)
Try it and put GitHub link. For bench-marking purposes do a simple project of calculating first million prime numbers. I'll do the same in C using your chosen algorithm.
Re:Building even faster interpreters in Rust
by FullyFunctional on Monday September 28, 2020 @12:37PM
(#24618489)
That's not a particularly good representative of real applications, but I'll be happy to do the study for you. Let me introduce you to my consulting fees.
A sufficiently smart interpreter for a language can be faster than a native binary as the former has the freedom to adapt to dynamic conditions. This is the essential point of JITs. It beats ahead of time compilation when dynamic conditions do change but slowly enough to amortize the overhead of adapting to it.