An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh

DOI10.1016/0020-0190(93)90233-YzbMath0777.68048OpenAlexW2008348414MaRDI QIDQ685469

Hyoung Joong Kim, Viktor K. Prasanna, Heonchul Park

Publication date: 17 October 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90233-y

zbMATH Keywords

parallel processingVLSImatrix multiplicationarea-time complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (2)

MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗ ⋮ Scaling multiple addition and prefix sums on the reconfigurable mesh.

Cites Work

• Unnamed Item
• Unnamed Item
• Area-time optimal VLSI networks for multiplying matrices
• Area-time tradeoffs for matrix multiplication and related problems in VLSI models

This page was built for publication: An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh