Spacetime representations of computational structures

DOI10.1007/BF02253685MaRDI QIDQ1053457zbMATH OpenOpenAlexFDO

Authors A. Winkler, Willard L. Miranker

Publication date 1984

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02253685

zbMATH Keywords

data flowsystolic arrayssystolic algorithmcomputational structuresrealizing algorithms in hardware

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3300651 (Why is no real title available?)
• A Survey of Parallelism in Numerical Analysis
• Solving Triangular Systems on a Parallel Computer
• Spacetime representations of computational structures

Cited in

(14)

• Synthesis, structure and power of systolic computations
• Synthesis and equivalence of concurrent systems
• A hardware independent parallel programming model
• FINDING OPTIMUM WAVEFRONT OF PARALLEL COMPUTATION∗
• Two-dimensional iterative arrays: Characterizations and applications
• Forty-three ways of systolic matrix multiplication
• Systolic parsing of context-free languages
• Dynamic programming on two-dimensional systolic arrays
• Spacetime representations of computational structures
• Decoupling the dimensions of a system of affine recurrence equations
• Decomposing polynomial interpolation for systolic arrays
• Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming
• The design of optimal planar systolic arrays for matrix multiplication
• Designing of processor-time optimal systolic arrays for band matrix-vector multiplication

This page was built for publication: Spacetime representations of computational structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1053457)