Optimal systolic array algorithms for tensor product

DOI10.1016/j.amc.2004.09.045zbMath1101.68620OpenAlexW2022875460MaRDI QIDQ2572702

Yanyan Li

Publication date: 4 November 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.09.045

zbMATH Keywords

Computational complexityLower and upper boundsSystolic algorithmsTensor product

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Uses Software

• PolyLib
• SDEF
• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem
• Synthesis of a new systolic architecture for the algebraic path problem
• Systolic algorithm for tensor products of matrices: Implementation and applications
• A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
• Systolic algorithm for multivariable approximation using tensor products of basis functions
• On vector partition functions
• On the computational power of pushdown automata
• Linear homogeneous Diophantine equations and magic labelings of graphs
• The Design of Optimal Systolic Arrays
• Recursive fast algorithm and the role of the tensor product
• PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS
• Computationally Related Problems
• The parallel execution of DO loops
• PROCESSOR LOWER BOUND FORMULAS FOR ARRAY COMPUTATIONS AND PARAMETRIC DIOPHANTINE SYSTEMS
• Time optimal linear schedules for algorithms with uniform dependencies
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
• The Organization of Computations for Uniform Recurrence Equations
• A Theorem on Boolean Matrices