On the complexity of loop fusion

DOI10.1016/S0167-8191(00)00034-XzbMath0945.68070OpenAlexW2059564324MaRDI QIDQ1575601

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)

Related Items (5)

A note on the precedence-constrained class sequencing problem ⋮ An exact dynamic programming algorithm for the precedence-constrained class sequencing problem ⋮ Flooding games on graphs ⋮ The unit-capacity constrained permutation problem ⋮ Unnamed Item

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