Spacetime representations of computational structures

DOI10.1007/BF02253685zbMath0517.68059OpenAlexW161315898MaRDI QIDQ1053457

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

systolic arraysdata flowsystolic algorithmcomputational structuresrealizing algorithms in hardware

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Related Items (14)

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

Cites Work

• Spacetime representations of computational structures
• Solving Triangular Systems on a Parallel Computer
• A Survey of Parallelism in Numerical Analysis
• Unnamed Item

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