Partial redundancy elimination on predicted code

DOI10.1007/978-3-540-45099-3_14MaRDI QIDQ2722065zbMATH OpenFDO

Authors Jens Knoop, Jean-François Collard, Roy Dz-Ching Ju

Publication date 11 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-45099-3_14

zbMATH Keywords

busy code motiondata-flow analysisIA-64lazy code motionoptimizationpartial redundancy eliminationpredicated code

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• Compiler Construction
• Compiler Construction
• Partial redundancy elimination: A simple, pragmatic, and provably correct algorithm.
• A solution to a problem with Morel and Renvoise's “Global optimization by suppression of partial redundancies”
• Sparse code motion

Cited in

(12)

• Partial redundancy elimination: A simple, pragmatic, and provably correct algorithm.
• Redundancy elimination for LF
• Extension of superblock technique to hyperblock using predicate hierarchy graph
• A solution to a problem with Morel and Renvoise's “Global optimization by suppression of partial redundancies”
• Partial redundancy elimination for access path expressions
• Load redundancy elimination on executable code
• scientific article; zbMATH DE number 2090676 (Why is no real title available?)
• Sparse code motion
• Compiler Construction
• Compiler Construction
• Euro-Par 2004 Parallel Processing
• Languages and Compilers for Parallel Computing

This page was built for publication: Partial redundancy elimination on predicted code

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