A Mathematical Model for the Verification of Systolic Networks

DOI10.1137/0213034MaRDI QIDQ3338117zbMATH OpenOpenAlexFDO

Authors Rami Melhem, Werner C. Rheinboldt

Publication date 1984

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0213034

zbMATH Keywords

causal operators, VLSIdata sequencesmathematical model for systolic architecturessystolic networks

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Recommendations

• Verification of a class of self-timed computational networks
• Automatic verification of a class of systolic circuits
• Formal analysis of a systolic system for finite element stiffness matrices
• scientific article; zbMATH DE number 4056974
• Mechanical certification of systolic algorithms

Cited in

(9)

• Formal analysis of a systolic system for finite element stiffness matrices
• Verification of a class of self-timed computational networks
• Decoupling the dimensions of a system of affine recurrence equations
• Automatic verification of a class of systolic circuits
• The application of a sequence notation to the design of systolic computations
• Verifying an infinite systolic algorithm using third-order equational methods
• The cut theorem—a tool for design of systolic algorithms
• Systolic algorithms
• scientific article; zbMATH DE number 139974 (Why is no real title available?)

This page was built for publication: A Mathematical Model for the Verification of Systolic Networks

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