Computing transitive closure on systolic arrays of fixed size
DOI10.1007/BF02252956zbMATH Open0731.68087OpenAlexW2051233862MaRDI QIDQ808290FDOQ808290
Authors: Björn Lisper 
Publication date: 1991
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02252956
Recommendations
- Numerical Analysis and Its Applications
- Efficient computation of transitive closures
- scientific article; zbMATH DE number 4185046
- Algorithms for transitive closure
- Abstract derivation of transitive closure algorithms
- An experimental study of dynamic algorithms for transitive closure
- A fully dynamic algorithm for maintaining the transitive closure
- A fully dynamic algorithm for maintaining the transitive closure
- An experimental study of algorithms for fully dynamic transitive closure
Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99) Distributed algorithms (68W15) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cites Work
- A Theorem on Boolean Matrices
- Parallel computation and conflicts in memory access
- Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
- Parallel Matrix and Graph Algorithms
- A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
- An orthogonal systolic array for the algebraic path problem
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- Synthesis of a new systolic architecture for the algebraic path problem
- A transitive closure algorithm
- Synthesizing linear array algorithms from nested FOR loop algorithms
- Transitive closure and related semiring properties via eliminants
- The space complexity of pebble games on trees
- Synthesizing synchronous systems by static scheduling in space-time
- On the Analysis and Synthesis of VLSI Algorithms
- A block algorithm and optimal fixed-size systolic array processor for the algebraic path problem
Cited In (11)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient computation of transitive closures
- The transitive closure and related algorithms of digraph on the reconfigurable architecture
- Title not available (Why is that?)
- Mapping dynamic programming onto modular linear systolic arrays
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical Analysis and Its Applications
- Size-estimation framework with applications to transitive closure and reachability
This page was built for publication: Computing transitive closure on systolic arrays of fixed size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808290)
