Jump Minimization in Linear Time

DOI10.1145/1780.357262MaRDI QIDQ3330482zbMATH OpenOpenAlexFDO

Authors M. V. S. Ramanath, Marvin Solomon

Publication date 1984

Published in ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1780.357262

zbMATH Keywords

loopsexit statement

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Branch distance optimization of structured programs
• Eliminating go to's while preserving program structure
• scientific article; zbMATH DE number 3965407
• Publication:4886067
• Register Allocation in Structured Programs

Cited in

(6)

• Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
• scientific article; zbMATH DE number 2036332 (Why is no real title available?)
• An algorithm for reducing binary branchings
• Indirect jumps improve instruction sequence performance
• An optimal algorithm for purging regular hammocks
• scientific article; zbMATH DE number 3965407 (Why is no real title available?)

This page was built for publication: Jump Minimization in Linear Time

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