Scheduling a system of nonsingular affine recurrence equations onto a processor array
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2079652
- Scheduling parallel iterative methods on multiprocessor systems
- Parallel scheduling of recursively defined arrays: Revisited
- Subspace scheduling and parallel implementation of non-systolic regular iterative algorithms
- scientific article; zbMATH DE number 1555966
- A parallel algorithm for evaluating general linear recurrence equations
- Synthesis aspects in the design of efficient processor arrays from affine recurrence equations
- scientific article; zbMATH DE number 1104473
Cited in
(12)- Decoupling the dimensions of a system of affine recurrence equations
- On time optimal implementation of uniform recurrences onto array processors via quadratic programming
- Synthesis aspects in the design of efficient processor arrays from affine recurrence equations
- Finding quadratic schedules for affine recurrence equations via nonsmooth optimization
- Mapping 3-D IIR digital filter onto systolic arrays
- LINEAR ARRAY FOR A CLASS OF NON UNIFORM RECURRENCE EQUATIONS
- scientific article; zbMATH DE number 2079652 (Why is no real title available?)
- scientific article; zbMATH DE number 3995003 (Why is no real title available?)
- scientific article; zbMATH DE number 2090598 (Why is no real title available?)
- New results on computability of recurrence equations
- Subspace scheduling and parallel implementation of non-systolic regular iterative algorithms
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
This page was built for publication: Scheduling a system of nonsingular affine recurrence equations onto a processor array
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5750385)
