Branch Distance Optimization of Structured Programs

Publication Type

Journal Article

Publication Date

1990

Abstract

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

Discipline

Numerical Analysis and Scientific Computing

Publication

Computers and Mathematics with Applications

Volume

19

Issue

12

First Page

53

Last Page

64

ISSN

0898-1221

Identifier

10.1016/0898-1221(90)90251-e

Publisher

Elsevier

Additional URL

http://doi.org/10.1016/0898-1221(90)90251-e

Link to Full Text

Share

COinS