Proebsting's Law

[Andy Armstrong]

On 14 Dec 2005, at 20:09, David Landgren wrote:
> It weaves its magic by assembling code paths into fragments, and  
> then fragments of fragments over and over again. The end result is  
> long, branchless runs of machine code... something that fits right  
> in with modern CPU architectures and their long, fragile pipelines.

I've often though that JVMs should be able to work similar faster- 
than-native magic. They went in the right direction with the hotspot  
dynamic native code generator but it seems to me that more could be  
done.

-- 
Andy Armstrong, hexten.net