Branch Distance Optimization of Structured Programs
One of the functions of code generation (or peephole optimization of generated code) is to find a linear arrangement of code segments such that the sum of branch distances between code segments is minimized. The problem is a generalization of the optimal linear arrangement problem which is known to be NP-hard. However, it has important applications in generating object code for pipeline and cache machines. This paper presents a branch-and-bound method which incorporates a heuristic for deriving a near-optimal initial solution
Numerical Analysis and Scientific Computing
Intelligent Systems and Decision Analytics
Computers and Mathematics with Applications
Powell, P. and LAU, Hoong Chuin.
Branch Distance Optimization of Structured Programs. (1990). Computers and Mathematics with Applications. 19, (12), 53-64. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/39