Finding quadratic schedules for affine recurrence equations via nonsmooth optimization

DOI10.1023/A:1008139706909MaRDI QIDQ1584052zbMATH OpenOpenAlexFDO

Authors Wolfgang Achtziger, Karl-Heinz Zimmermann

Publication date 24 June 2001

Published in Journal of VLSI signal processing systems for signal, image and video technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008139706909

zbMATH Keywords

optimal quadratic schedules

Mathematics Subject Classification ID

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

Recommendations

• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• Some efficient solutions to the affine scheduling problem. II: Multidimensional time
• Scheduling a system of nonsingular affine recurrence equations onto a processor array
• Affine scheduling on bounded convex polyhedric domains is asymptotically optimal
• On time optimal implementation of uniform recurrences onto array processors via quadratic programming

Cited in

(4)

• Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming
• Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
• scientific article; zbMATH DE number 4070258 (Why is no real title available?)
• On loop transformations of nested loops with affine dependencies

This page was built for publication: Finding quadratic schedules for affine recurrence equations via nonsmooth optimization

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