Spacetime-minimal systolic architectures for Gaussian elimination and the algebraic path problem
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 746-757
- https://doi.org/10.1109/asap.1990.145509
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Uniformization of linear recurrence equations: a step toward the automatic synthesis of systolic arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Systolic givens factorization of dense rectangular matricesInternational Journal of Computer Mathematics, 1988
- Optimal Systolic Design for the Transitive Closure and the Shortest Path ProblemsIEEE Transactions on Computers, 1987
- Partitioning and Mapping Algorithms into Fixed Size Systolic ArraysIEEE Transactions on Computers, 1986
- A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion)Computing, 1985
- Wafer-scale integration and two-level pipelined implementations of systolic arraysJournal of Parallel and Distributed Computing, 1984
- Algorithm-Based Fault Tolerance for Matrix OperationsIEEE Transactions on Computers, 1984
- Partitioned Matrix Algorithms for VLSI Arithmetic SystemsIEEE Transactions on Computers, 1982
- Highly concurrent computing structures for matrix arithmetic and signal processingComputer, 1982