3 ms·
> I mean that if K or some language is actually interpreting without a virtual machine at some stage, that is indeed going to be slower than any language with c
by lmm 5y ago
> I mean that if K or some language is actually interpreting without a virtual machine at some stage, that is indeed going to be slower than any language with code running on a virtual machine.
Not necessarily. The VM itself will introduce overhead and potentially blow out cache etc.. You can argue, as the article does, that this is a small proportion of execution time if you're executing a lot of loops, but that's inherently workload-dependent. If the language being interpreted is denser than the VM bytecode - something that's believable for a language like K - then interpreting directly makes more efficient use of memory bandwidth than interpreting via bytecode.
- eatonphil 5y agoThat's an interesting idea, I missed that. Has anyone published a PoC of this (not necessarily using any of these languages) that would give some quantitative credence?