Adaptive optimization: Difference between revisions

Revision as of 17:24, 14 June 2008

Revision as of 09:43, 24 June 2008

Line 5:

==Deoptimization==

In some systems, notably the [[Java Virtual Machine]], execution over a range of [[Java bytecode|bytecode instructions]] can be provably reversed. This allows an adaptive optimizer to make risky assumptions about the code. In the above example, the optimizer may assume all transactions are checks and all account numbers ofare valid. When these assumptions prove incorrect, the adaptive optimizer can 'unwind' to a valid state and then interpret the byte code instructions correctly.

==See also==