The "jump threading" compiler optimization (aka -fthread-jump) turns conditional into unconditional branches on certain paths at the expense of code size. For hardware with branch prediction, speculative execution, and prefetching, this can greatly improve performance. However, there is no scientific publication or documentation at all. The Wikipedia article is very short and incomplete.
The linked article has an illustrated treatment of common code structures and how these optimizations work.
(Score: 2) by Dr Ippy on Monday November 02 2015, @11:19AM
Very deterministic thinking. But presumably a quantum computer would be able to execute all branches in the code simultaneously, even if there's a huge number of possibilities.
This signature intentionally left blank.