An integer programming approach to optimal basic block instruction scheduling for single-issue processors
From MaRDI portal
Publication:1751173
Mathematical problems of computer architecture (68M07) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of compilers and interpreters (68N20) General topics in the theory of algorithms (68W01) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Combinatorial optimization (90C27)
Recommendations
- scientific article; zbMATH DE number 2084744
- Using integer linear programming for instruction scheduling and register allocation in multi-issue processors
- A cyclic scheduling problem with an undetermined number of parallel identical processors
- Learning heuristics for basic block instruction scheduling
- A unified framework for instruction scheduling and mapping for function units with structural hazards
Cites work
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
- An algorithm for the single machine sequencing problem with precedence constraints
- Approximation algorithms for scheduling arithmetic expressions on pipelined machines
- Data-dependency graph transformations for instruction scheduling
- Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
- Facets of the linear ordering polytope
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- scientific article; zbMATH DE number 4181112 (Why is no real title available?)
- scientific article; zbMATH DE number 53772 (Why is no real title available?)
- scientific article; zbMATH DE number 176470 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2080315 (Why is no real title available?)
- scientific article; zbMATH DE number 2084744 (Why is no real title available?)
- scientific article; zbMATH DE number 2084781 (Why is no real title available?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Principles and Practice of Constraint Programming – CP 2004
- Scheduling expressions on a pipelined processor with a maximal delay of one cycle
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
- Single machine scheduling subject to precedence delays
- Single-Machine Scheduling with Precedence Constraints
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- Using integer linear programming for instruction scheduling and register allocation in multi-issue processors
Cited in
(5)- Learning heuristics for basic block instruction scheduling
- Using integer linear programming for instruction scheduling and register allocation in multi-issue processors
- Building a basic block instruction scheduler with reinforcement learning and rollouts
- scientific article; zbMATH DE number 2084744 (Why is no real title available?)
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem
This page was built for publication: An integer programming approach to optimal basic block instruction scheduling for single-issue processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751173)
