Data-dependency graph transformations for instruction scheduling

DOI10.1007/S10951-005-2862-8MaRDI QIDQ880512zbMATH OpenOpenAlexFDO

Authors Mark Heffernan, Kent Wilken

Publication date 15 May 2007

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-005-2862-8

zbMATH Keywords

compiler schedulinggraph transformationinstruction schedulingoptimal scheduling

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Code reorganization using the data dependence graph for vector-pipeline computers
• scientific article; zbMATH DE number 919851
• Assigning dependency graphs onto processor networks

Cites work

• scientific article; zbMATH DE number 3845501 (Why is no real title available?)
• scientific article; zbMATH DE number 1820639 (Why is no real title available?)
• Introduction to algorithms
• Optimal Scheduling Strategies in a Multiprocessor System
• Postpass Code Optimization of Pipeline Constraints
• Project scheduling under limited resources. Models, methods, and applications
• Scheduling as a Graph Transformation
• Scheduling of resource-constrained projects
• The Power of Dominance Relations in Branch-and-Bound Algorithms

Cited in

(5)

• An integer programming approach to optimal basic block instruction scheduling for single-issue processors
• Comparing tail duplication with compensation code in single path global instruction scheduling
• A global-optimized scheduling algorithm based on a combination of sub-graphs
• Tree traversal scheduling: A global instruction scheduling technique for VLIW/EPIC processors
• Handling irreducible loops: Optimized node splitting vs. DJ-graphs

This page was built for publication: Data-dependency graph transformations for instruction scheduling

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