On the complexity of loop fusion

DOI10.1016/S0167-8191(00)00034-XMaRDI QIDQ1575601zbMATH OpenOpenAlexFDO

Authors Alain Darte

Publication date 21 August 2000

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(00)00034-x

zbMATH Keywords

complexityparallelizationloop fusionloop distribution

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 2086384
• On the parallel complexity of loops
• Fast greedy weighted fusion
• Publication:4501868
• Loop parallelization algorithms: From parallelism extraction to code generation

Cited in

(10)

• Flooding games on graphs
• Fast greedy weighted fusion
• Fission for Program Comprehension
• The unit-capacity constrained permutation problem
• scientific article; zbMATH DE number 2086384 (Why is no real title available?)
• A note on the precedence-constrained class sequencing problem
• An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
• Combinatorial point for fused loop models
• An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives
• Push versus pull-based loop fusion in query engines

This page was built for publication: On the complexity of loop fusion

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