Branch distance optimization of structured programs

DOI10.1016/0898-1221(90)90251-EzbMATH Open0728.68035OpenAlexW2053193812MaRDI QIDQ805220FDOQ805220

Authors N. E. Zubov

Publication date 1990

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(90)90251-e

zbMATH Keywords

NP-hardbranch-and-bound methodcode generationbranch distance optimizationoptimal linear arrangement problemstructured programs

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Jump Minimization in Linear Time
• scientific article; zbMATH DE number 4043771
• Code reorganization using the data dependence graph for vector-pipeline computers
• scientific article; zbMATH DE number 3926277
• scientific article; zbMATH DE number 3965407

Cites work

• scientific article; zbMATH DE number 3902051 (Why is no real title available?)
• scientific article; zbMATH DE number 3592938 (Why is no real title available?)
• Algorithms for Scheduling Independent Tasks
• Assembling code for machines with span-dependent instructions
• Chaining Span-Dependent Jump Instructions
• Code Generation and Storage Allocation for Machines with Span-Dependent Instructions
• Some simplified NP-complete graph problems

Cited in

(3)

• scientific article; zbMATH DE number 58305 (Why is no real title available?)
• scientific article; zbMATH DE number 1881085 (Why is no real title available?)
• Jump Minimization in Linear Time

Describes a project that uses

Uses Software

• LOLIB

This page was built for publication: Branch distance optimization of structured programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805220)