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

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

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)

Cites Work

• Algorithms for Scheduling Independent Tasks
• Some simplified NP-complete graph problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Code Generation and Storage Allocation for Machines with Span-Dependent Instructions
• Chaining Span-Dependent Jump Instructions
• Assembling code for machines with span-dependent instructions

Cited In (3)

• Title not available (Why is that?)
• Jump Minimization in Linear Time
• Title not available (Why is that?)

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)