Fast optimal instruction scheduling for single-issue processors with arbitrary latencies

DOI10.1007/3-540-45578-7_52MaRDI QIDQ4475675zbMATH OpenFDO

Authors Kent Wilken, P. van Beek

Publication date 9 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390625.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of compilers and interpreters (68N20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• An integer programming approach to optimal basic block instruction scheduling for single-issue processors
• Learning heuristics for basic block instruction scheduling
• Using integer linear programming for instruction scheduling and register allocation in multi-issue processors
• Optimal scheduling for exposed datapath architectures with buffered processing units by ASP
• Instruction scheduling with timing constraints on a single RISC processor with 0/1 latencies

Cited in

(17)

• Learning heuristics for basic block instruction scheduling
• A bound analysis of scheduling instructions on pipelined processors with a maximal delay of one cycle
• A unified framework for instruction scheduling and mapping for function units with structural hazards
• 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
• An integer programming approach to optimal basic block instruction scheduling for single-issue processors
• Backtracking-based instruction scheduling to fill branch delay slots
• Cardinality constraints and systems of restricted representatives
• CLP approach to optimal instruction scheduling for VLIW processors
• Instruction scheduling with timing constraints on a single RISC processor with 0/1 latencies
• Scheduling instructions with uncertain latencies in asynchronous architectures
• Optimal scheduling for exposed datapath architectures with buffered processing units by ASP
• Static Instruction Scheduling for High Performance on Limited Hardware
• How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations
• Adapting convergent scheduling using machine-learning
• An efficient bounds consistency algorithm for the global cardinality constraint
• Periodic real-time scheduling: From deadline-based model to latency-based model

Describes a project that uses

Uses Software

• MediaBench

This page was built for publication: Fast optimal instruction scheduling for single-issue processors with arbitrary latencies

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