Synthesis of a new systolic architecture for the algebraic path problem
From MaRDI portal
Publication:757083
DOI10.1016/0167-6423(90)90082-OzbMATH Open0723.68076MaRDI QIDQ757083FDOQ757083
Authors: Abdelhamid Benaini, Yves Robert, Patrice Quinton, Yannick Saouter, Bernard Tourancheau 
Publication date: 1990
Published in: Science of Computer Programming (Search for Journal in Brave)
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
Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80) Distributed algorithms (68W15) General theory of computer systems (68M01)
Cited In (12)
- Optimal systolic array algorithms for tensor product
- Title not available (Why is that?)
- Mechanical certification of systolic algorithms
- Algorithm transformations for computational and data broadcast
- An incremental mechanical development of systolic solutions to the algebraic path problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Derivation of systolic algorithms for the algebraic path problem by recurrence transformations
- Synthesis aspects in the design of efficient processor arrays from affine recurrence equations
- Title not available (Why is that?)
- Synthesis of size-optimal toroïdal arrays for the algebraic path problem: A new contribution
- Computing transitive closure on systolic arrays of fixed size
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)
