On the optimality of linear schedules
From MaRDI portal
Recommendations
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- An improved systolic algorithm for the algebraic path problem
- Affine scheduling on bounded convex polyhedric domains is asymptotically optimal
- Some efficient solutions to the affine scheduling problem. II: Multidimensional time
- Scalable and structured scheduling
Cited in
(18)- Optimal loop storage allocation for argument-fetching dataflow machines
- 1-optimality of static BSP computations: Scheduling independent chains as a case study.
- The problem of schedule construction in the joint design of hardware and software
- On minimizing register usage of linearly scheduled algorithms with uniform dependencies
- A probe-based algorithm for piecewise linear optimization in scheduling
- On the power of the linear array architecture for performing tree- structured computations
- LINEAR ARRAY FOR A CLASS OF NON UNIFORM RECURRENCE EQUATIONS
- Design of space-optimal regular arrays for algorithms with linear schedules
- Optimal data scheduling for uniform multidimensional applications
- scientific article; zbMATH DE number 1984150 (Why is no real title available?)
- On the optimality of Feautrier's scheduling algorithm
- scientific article; zbMATH DE number 1543369 (Why is no real title available?)
- Total unfolding: theory and applications
- scientific article; zbMATH DE number 2090597 (Why is no real title available?)
- A‐OPTIMAL RUN ORDERS WITH A LINEAR TREND
- Time optimal linear schedules for algorithms with uniform dependencies
- Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
This page was built for publication: On the optimality of linear schedules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5750384)
