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 |
| id |
sg-smu-ink.sis_research-1038 |
|---|---|
| record_format |
dspace |
| spelling |
sg-smu-ink.sis_research-10382016-12-14T00:51:02Z Branch Distance Optimization of Structured Programs Powell, P. LAU, Hoong Chuin 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 1990-01-01T08:00:00Z text https://ink.library.smu.edu.sg/sis_research/39 info:doi/10.1016/0898-1221(90)90251-e http://doi.org/10.1016/0898-1221(90)90251-e Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Numerical Analysis and Scientific Computing |
| institution |
Singapore Management University |
| building |
SMU Libraries |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
SMU Libraries |
| collection |
InK@SMU |
| language |
English |
| topic |
Numerical Analysis and Scientific Computing |
| spellingShingle |
Numerical Analysis and Scientific Computing Powell, P. LAU, Hoong Chuin Branch Distance Optimization of Structured Programs |
| description |
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 |
| format |
text |
| author |
Powell, P. LAU, Hoong Chuin |
| author_facet |
Powell, P. LAU, Hoong Chuin |
| author_sort |
Powell, P. |
| title |
Branch Distance Optimization of Structured Programs |
| title_short |
Branch Distance Optimization of Structured Programs |
| title_full |
Branch Distance Optimization of Structured Programs |
| title_fullStr |
Branch Distance Optimization of Structured Programs |
| title_full_unstemmed |
Branch Distance Optimization of Structured Programs |
| title_sort |
branch distance optimization of structured programs |
| publisher |
Institutional Knowledge at Singapore Management University |
| publishDate |
1990 |
| url |
https://ink.library.smu.edu.sg/sis_research/39 http://doi.org/10.1016/0898-1221(90)90251-e |
| _version_ |
1770568863375687680 |