Affine scheduling on bounded convex polyhedric domains is asymptotically optimal

DOI10.1016/S0304-3975(97)00209-0MaRDI QIDQ1128739zbMATH OpenOpenAlexFDO

Authors Patrick Le Gouëslier d'Argence

Publication date 13 August 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(97)00209-0

zbMATH Keywords

automatic parallelizationlinear programminglongest path in a graph

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• Some efficient solutions to the affine scheduling problem. II: Multidimensional time
• Finding quadratic schedules for affine recurrence equations via nonsmooth optimization

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 1503713 (Why is no real title available?)
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• Some efficient solutions to the affine scheduling problem. II: Multidimensional time
• The Organization of Computations for Uniform Recurrence Equations

Cited in

(4)

• Some efficient solutions to the affine scheduling problem. II: Multidimensional time
• Finding quadratic schedules for affine recurrence equations via nonsmooth optimization
• On the optimality of linear schedules
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time

This page was built for publication: Affine scheduling on bounded convex polyhedric domains is asymptotically optimal

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