Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem

DOI10.1016/0167-8191(90)90044-AzbMath0714.65027OpenAlexW4301706555MaRDI QIDQ751176

Yves Robert, Abdelhamid Benaini

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90044-a

zbMATH Keywords

systolic arraysGaussian eliminationalgebraic path problemminimum number of computing stepsnumber of processorstime-minimal solutions

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (6)

PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS ⋮ A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems ⋮ A fault tolerant systolic mesh for linear system solution ⋮ PROCESSOR LOWER BOUND FORMULAS FOR ARRAY COMPUTATIONS AND PARAMETRIC DIOPHANTINE SYSTEMS ⋮ An optimal schedule for Gaussian elimination on an MIMD architecture ⋮ Optimal systolic array algorithms for tensor product

This page was built for publication: Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem