PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS

DOI10.1080/01495730008947355zbMath0968.68010OpenAlexW2070700392MaRDI QIDQ4526929

Peter R. Cappello, Chris J. Scheiman, Ömer Eğecioğlu

Publication date: 31 January 2001

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01495730008947355

zbMATH Keywords

directed acyclic graph

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Optimal systolic array algorithms for tensor product

Cites Work

• Unnamed Item
• Unnamed Item
• Spacetime-minimal systolic arrays for Gaussian elimination and 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
• 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
• Computationally Related Problems
• The parallel execution of DO loops
• PROCESSOR LOWER BOUND FORMULAS FOR ARRAY COMPUTATIONS AND PARAMETRIC DIOPHANTINE SYSTEMS
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
• The Organization of Computations for Uniform Recurrence Equations
• A Theorem on Boolean Matrices

This page was built for publication: PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS