Computer arithmetic algorithms
Computer arithmetic algorithms
Journal of Parallel and Distributed Computing
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
Information Processing Letters
An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh
Information Processing Letters
Reconfigurable Buses with Shift Switching: Concepts and Applications
IEEE Transactions on Parallel and Distributed Systems
Efficient self-simulation algorithms for reconfigurable arrays
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
This paper presents the following results for matrix-vector multiplication on the reconfigurable mesh (R-Mesh). Multiplication of an N \times N matrix and an N \times 1 vector (each element of which is an integer of w bits) can be performed in O(\log w) time on a two-dimensional O\left(N\frac{w}{\log w}{\log^2 N}\right) \times O\left(N\frac{w}{\log w}{\log^2 N}\right) R-Mesh or a three-dimensional N\times N\times\left(\frac{w}{\log w}\log^2N\right) R-Mesh; in both cases, inputs and outputs are stored as w-bit integers. A natural extension of this problem is for floating point inputs; floating point numbers have not been handled before on any reconfigurable bus-based model. Matrix-vector multiplication with floating point inputs can be performed in O\left(\max\{\log\log N,\log w\}\right) time on an \mbox{N \times N \times \max\left\{\sqrt{\frac{N}{\log\log N}},\frac{w}{\log w} \log^{2} N\right\} } three-dimensional R-Mesh, with the inputs and outputs stored as w-bit floating point numbers.