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

DOI10.1016/0167-8191(90)90044-AzbMATH Open0714.65027OpenAlexW4301706555MaRDI QIDQ751176FDOQ751176

Authors: Abdelhamid Benaini, Yves Robert 

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

Recommendations

• scientific article; zbMATH DE number 3870611
• scientific article; zbMATH DE number 4215247
• scientific article; zbMATH DE number 125143
• A modular systolic linear array for gaussian elimination
• PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS

zbMATH Keywords

Gaussian eliminationsystolic arraysalgebraic path problemminimum number of computing stepsnumber of processorstime-minimal solutions

Mathematics Subject Classification ID

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

Cited In (8)

• An optimal schedule for Gaussian elimination on an MIMD architecture
• Optimal systolic array algorithms for tensor product
• PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS
• Title not available (Why is that?)
• Title not available (Why is that?)
• A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems
• Processor lower bound formulas for array computations and parametric Diophantine systems
• A fault tolerant systolic mesh for linear system solution

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

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