New linear systolic arrays for the string comparison algorithm

DOI10.1016/0167-8191(93)90025-GMaRDI QIDQ1315938zbMATH OpenOpenAlexFDO

Authors M. Gušev, D. J. Evans

Publication date 24 March 1994

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(93)90025-g

zbMATH Keywords

algorithm transformationdata broadcast eliminationdata dependencefolding transformationinterlocking translationsymmetrical mappingVLSI processor arrays

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Improved linear systolic algorithms for substring statistics
• scientific article; zbMATH DE number 139810
• A fast VLSI solution for approximate string matching
• The Design of Optimal Systolic Arrays
• scientific article; zbMATH DE number 4111978

Cited in

(4)

• THE MAGIC OF INTERLOCKING PROPERTY: FAST SYSTOLIC DESIGN
• scientific article; zbMATH DE number 3876649 (Why is no real title available?)
• scientific article; zbMATH DE number 139810 (Why is no real title available?)
• Algorithm transformations for computational and data broadcast

This page was built for publication: New linear systolic arrays for the string comparison algorithm

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