Synthesis of a new systolic architecture for the algebraic path problem
From MaRDI portal
(Redirected from Publication:757083)
Recommendations
- Synthesizing systolic arrays from recurrence equations
- Automatic verification of a class of systolic circuits
- scientific article; zbMATH DE number 3976313
- scientific article; zbMATH DE number 108384
- scientific article; zbMATH DE number 4026817
- scientific article; zbMATH DE number 3958722
- Generic systolic arrays: A methodology for systolic design
- scientific article; zbMATH DE number 2217746
Cited in
(12)- scientific article; zbMATH DE number 3952666 (Why is no real title available?)
- scientific article; zbMATH DE number 3954292 (Why is no real title available?)
- An incremental mechanical development of systolic solutions to the algebraic path problem
- Optimal systolic array algorithms for tensor product
- Synthesis aspects in the design of efficient processor arrays from affine recurrence equations
- scientific article; zbMATH DE number 64177 (Why is no real title available?)
- scientific article; zbMATH DE number 4084839 (Why is no real title available?)
- Derivation of systolic algorithms for the algebraic path problem by recurrence transformations
- Mechanical certification of systolic algorithms
- Computing transitive closure on systolic arrays of fixed size
- Synthesis of size-optimal toroïdal arrays for the algebraic path problem: A new contribution
- Algorithm transformations for computational and data broadcast
This page was built for publication: Synthesis of a new systolic architecture for the algebraic path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757083)