An integer programming approach to optimal basic block instruction scheduling for single-issue processors
DOI10.1016/j.disopt.2015.10.003zbMath1387.90137OpenAlexW2226668172MaRDI QIDQ1751173
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2015.10.003
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Theory of compilers and interpreters (68N20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07) General topics in the theory of algorithms (68W01)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- Data-dependency graph transformations for instruction scheduling
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Using integer linear programming for instruction scheduling and register allocation in multi-issue processors
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
- Single machine scheduling subject to precedence delays
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
- Facets of the linear ordering polytope
- Scheduling expressions on a pipelined processor with a maximal delay of one cycle
- An algorithm for the single machine sequencing problem with precedence constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Approximation algorithms for scheduling arithmetic expressions on pipelined machines
- 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
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- Single-Machine Scheduling with Precedence Constraints
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: An integer programming approach to optimal basic block instruction scheduling for single-issue processors
