Scheduling Arithmetic and Load Operations in Parallel with No Spilling

DOI10.1137/0218074MaRDI QIDQ3034811zbMATH OpenOpenAlexFDO

Authors

Publication date 1989

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0218074

zbMATH Keywords

code generationcompilersdynamic programmingparallel functional unitsscheduling algorithms

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39)

Recommendations

• Dual-issue scheduling for binary trees with spills and pipelined loads
• scientific article; zbMATH DE number 3900151
• scientific article; zbMATH DE number 1305461
• Scheduling expressions on a pipelined processor with a maximal delay of one cycle
• Approximation algorithms for scheduling arithmetic expressions on pipelined machines

Cited in

(4)

• Dual-issue scheduling for binary trees with spills and pipelined loads
• Optimal chaining in expression trees
• scientific article; zbMATH DE number 1305461 (Why is no real title available?)
• Register saturation in instruction level parallelism

This page was built for publication: Scheduling Arithmetic and Load Operations in Parallel with No Spilling

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