The idea is to position the basic blocks of a procedure in such a way that most executions of the code will fall through branches (forward branches are typically predicted ...

The category of ProgramOptimizations. SEARCH{search "CategoryOptimization" nosummary "on" scope "text" noheader "on" nosearch "on" format " $topic " } CategoryCategory ...

CodeCompaction is a class of ProgramOptimizations that reduce the size of a program. This is especially important for embedded software that is used on devices with ...

Code generation (also called selection) is a transformation performed in the back-ends of compilers. At this state of compilation representation expressions are transformed ...

by MichaelWolfe. Addison-Wesley, 1995. From the author: http://www.pgroup.com/~mwolfe/book/ From the publisher: http://www.awl-he.com/titles/0805327304.html http: ...

Partial evaluation is a ProgramOptimization technique in which a program is specialized to a part of the input that is known statically (at specialization time). Partial ...

ProgramOptimization is a kind of ProgramTransformation aimed at improving the time or memory performance of a program. CompilationByTransformation makes heavy use ...

ProgramSpecialization is used where a variable is known to often hold one particular value. In this case, it is possible to generate code taking advantage of this ...

A function call as the last action of function body can be optimized by overwriting the stack frame of the caller. The callee returns directly to the caller of its ...

Tail recursion elimination is a special case of call elimination in which the tail call is a call to the function itself. In that case the call can be replaced by ...