Postpass Code Optimization of Pipeline Constraints

DOI10.1145/2166.357217zbMath0525.68020OpenAlexW2048936605WikidataQ50822499 ScholiaQ50822499MaRDI QIDQ3038614

Thomas Groß, John L. Hennessy

Publication date: 1983

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2166.357217

zbMATH Keywords

schedulingheuristic algorithmcomputer architectureregister allocationpipeline processorsinstruction reorderingcode reorganizationpipeline interlocksreorganization of machine-level instructions at compile timeVLSI processor design

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Related Items (6)

The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays ⋮ Data-dependency graph transformations for instruction scheduling ⋮ An introduction to compilation issues for parallel machines ⋮ High speed synchronization of processors using fuzzy barriers ⋮ Integrating code generation and peephole optimization ⋮ Optimal loop storage allocation for argument-fetching dataflow machines

This page was built for publication: Postpass Code Optimization of Pipeline Constraints