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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
1990
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/39 http://doi.org/10.1016/0898-1221(90)90251-e |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |