Approximation algorithms for scheduling arithmetic expressions on pipelined machines

DOI10.1016/0196-6774(89)90027-8MaRDI QIDQ4203814zbMATH OpenOpenAlexFDO

Authors

Publication date 1989

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(89)90027-8

zbMATH Keywords

level algorithmspipeliningschedulingupper bound

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the complexity of scheduling problems for parallel/pipelined machines
• Approximation schemes for scheduling on parallel machines
• Approximation Algorithms For Scheduling On Uniform Processors
• Approximation algorithms for parallel machine scheduling with speed-up resources
• scientific article; zbMATH DE number 1760037
• scientific article; zbMATH DE number 1979517
• Approximation algorithms for general parallel task scheduling
• Approximation for scheduling on uniform nonsimultaneous parallel machines
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation algorithms for scheduling parallel jobs

Cited in

(4)

• A bound analysis of scheduling instructions on pipelined processors with a maximal delay of one cycle
• An integer programming approach to optimal basic block instruction scheduling for single-issue processors
• Scheduling Arithmetic and Load Operations in Parallel with No Spilling
• Scheduling expressions on a pipelined processor with a maximal delay of one cycle

This page was built for publication: Approximation algorithms for scheduling arithmetic expressions on pipelined machines

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