Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem
From MaRDI portal
(Redirected from Publication:751176)
This paper describes systolic arrays for Gaussian elimination and the algebraic path problem, in which the theoretical minimum number of computing steps is achieved, and the number of processors required is minimized among these time-minimal solutions.
Recommendations
Cited in
(9)- An optimal schedule for Gaussian elimination on an MIMD architecture
- Optimal systolic array algorithms for tensor product
- scientific article; zbMATH DE number 4215247 (Why is no real title available?)
- scientific article; zbMATH DE number 3954292 (Why is no real title available?)
- scientific article; zbMATH DE number 1741001 (Why is no real title available?)
- A fault tolerant systolic mesh for linear system solution
- PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS
- Processor lower bound formulas for array computations and parametric Diophantine systems
- A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems
This page was built for publication: Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751176)