TRYD (Trace Rewriter Yielding Dynamics): reconstitutes a CFG from traces in order to not only JIT single hot paths but also multiple interlacing warm ones
MAI (Machine-Agnostic Interpreter): support for mobile processes and agents
Do you have more information on that? Googling didn't turn much up. It sounds similar to the Trace Tree or region based compilation approaches?
(to be clear, what I had in mind: not just merging trace heads to form a tree, but merging their tails as well [à la NFA minimisation] to form a cyclic graph; after which one could use region-based techniques on the identified cycles.
Rpython's metatracing does a reasonable job for multiple interlacing warm paths, but there's still room for improvement)