Computer arithmetic algorithms
Computer arithmetic algorithms
Handbook of theoretical computer science (vol. A)
Journal of Parallel and Distributed Computing
Information Processing Letters
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
A Fast Algorithm for Computing a Histogram on Reconfigurable Mesh
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
An optimal sorting algorithm on reconfigurable mesh
Journal of Parallel and Distributed Computing
On the power of segmenting and fusing buses
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
Constant time graph algorithms on the reconfigurable multiple bus machine
Journal of Parallel and Distributed Computing
Integer summing algorithms on reconfigurable meshes
Theoretical Computer Science
IEEE Transactions on Parallel and Distributed Systems
Scaling Simulation of the Fusing-Restricted Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
Optimally scaling permutation routing on reconfigurable linear arrays with optical buses
Journal of Parallel and Distributed Computing
Adaptive AT2 optimal algorithms on reconfigurable meshes
Parallel Computing
Using bus linearization to scale the reconfigurable mesh
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
The usual concern when scaling an algorithm on a parallel model of computation is preserving efficiency while increasing or decreasing the number of processors. Many algorithms for reconfigurable models, however, attain constant time at the expense of an inefficient algorithm. For these algorithms, scaling down the number of processors while preserving inefficiency is no benefit once constant time execution is lost. In fact, one can often accelerate the efficiency of these algorithms while reducing the number of processors. To quantify this improvement in efficiency, this paper introduces the measure of degree of scalability to complement the insight obtained from efficiency for such algorithms. Demonstrating the utility of this measure, we present new reconfigurable mesh (R-Mesh) algorithms for multiple addition and matrix-vector multiplication, improving both the number of processors and the degree of scalability compared to previous algorithms. We also extend these results to floating point number operands, which have previously received little attention on the R-Mesh.