On the optimality of Feautrier's scheduling algorithm

DOI10.1002/CPE.780MaRDI QIDQ4432744zbMATH OpenOpenAlexFDO

Authors Frédéric Vivien

Publication date 29 October 2003

Published in Concurrency and Computation: Practice and Experience (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/cpe.780

zbMATH Keywords

automatic parallelizationFarkas'lemmaparallelism detectionschedulingvertex method

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2090597
• Scheduling Sequential Loops on Parallel Processors
• On the optimality of linear schedules
• Some efficient solutions to the affine scheduling problem. II: Multidimensional time
• Loop parallelization algorithms: From parallelism extraction to code generation

Cites work

• Dataflow analysis of array and scalar references
• The parallel execution of DO loops

Cited in

(5)

• Optimal algorithms for scheduling under time-of-use tariffs
• scientific article; zbMATH DE number 3908144 (Why is no real title available?)
• scientific article; zbMATH DE number 2087847 (Why is no real title available?)
• scientific article; zbMATH DE number 2090597 (Why is no real title available?)
• scientific article; zbMATH DE number 7529517 (Why is no real title available?)

This page was built for publication: On the optimality of Feautrier's scheduling algorithm

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