Scheduling loops with partial loop-carried dependencies

DOI10.1016/S0167-8191(00)00055-7MaRDI QIDQ1583375zbMATH OpenFDO

Authors R. Smith

Publication date 26 October 2000

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8191(00)00055-7

zbMATH Keywords

HPF 2.0inspection-executionirregular applicationsloop-carried dependenciestask scheduling

Mathematics Subject Classification ID

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

Recommendations

• Scheduling Sequential Loops on Parallel Processors
• Scalable and structured scheduling
• Data dependent loop scheduling based on genetic algorithms for distributed and shared memory systems
• Dynamic scheduling for dependence loops on heterogeneous clusters
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time

Cited in

(2)

• Data dependent loop scheduling based on genetic algorithms for distributed and shared memory systems
• Dynamic scheduling for dependence loops on heterogeneous clusters

This page was built for publication: Scheduling loops with partial loop-carried dependencies

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