Towards systolizing compilation
From MaRDI portal
Publication:757032
DOI10.1007/BF02311229zbMATH Open0723.68030OpenAlexW2046106811MaRDI QIDQ757032FDOQ757032
Authors: D. Kharzeev
Publication date: 1991
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02311229
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of compilers and interpreters (68N20) General theory of computer systems (68M01)
Cites Work
- Linear and combinatorial optimization in ordered algebraic structures
- Title not available (Why is that?)
- Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
- A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
- The derivation of systolic implementations of programs
- An orthogonal systolic array for the algebraic path problem
- An incremental mechanical development of systolic solutions to the algebraic path problem
- The mapping of linear recurrence equations on regular arrays
- Synthesizing systolic arrays from recurrence equations
- A methodology for programming with concurrency: The formalism
- Title not available (Why is that?)
- Synthesizing linear array algorithms from nested FOR loop algorithms
- The projection of systolic programs
Cited In (3)
Uses Software
This page was built for publication: Towards systolizing compilation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757032)