On the optimality of Feautrier's scheduling algorithm

DOI10.1002/cpe.780zbMath1031.68036OpenAlexW2029165396MaRDI QIDQ4432744

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

schedulingvertex methodautomatic parallelizationparallelism detectionFarkas'lemma

Mathematics Subject Classification ID

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

Cites Work

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

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