Data-dependency graph transformations for instruction scheduling

DOI10.1007/s10951-005-2862-8zbMath1123.90027OpenAlexW2041909047MaRDI QIDQ880512

Kent Wilken, Mark Heffernan

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

optimal schedulinggraph transformationinstruction schedulingcompiler scheduling

Mathematics Subject Classification ID

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

Related Items (1)

An integer programming approach to optimal basic block instruction scheduling for single-issue processors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling of resource-constrained projects
• Project scheduling under limited resources. Models, methods, and applications
• Postpass Code Optimization of Pipeline Constraints
• Scheduling as a Graph Transformation
• The Power of Dominance Relations in Branch-and-Bound Algorithms
• Optimal Scheduling Strategies in a Multiprocessor System

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