Adaptive optimization: Difference between revisions

Revision as of 00:03, 7 June 2011

Revision as of 00:06, 7 June 2011

Line 5:

==Deoptimization==

In some systems, notably the [[Java Virtual Machine]]{{factCitation needed|date=June 2011}}, 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 are 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==