Structural parallel algorithmics
Proceedings of the 18th international colloquium on Automata, languages and programming
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Journal of Parallel and Distributed Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
Reconfigurable Buses with Shift Switching: Concepts and Applications
IEEE Transactions on Parallel and Distributed Systems
Parallel Constant-Time Connectivity Algorithms on a Reconfigurable Network of Processors
IEEE Transactions on Parallel and Distributed Systems
The complexity of reconfiguring network models
Information and Computation
Efficient self-simulation algorithms for reconfigurable arrays
Journal of Parallel and Distributed Computing
Symmetric logspace is closed under complement
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On the Design and Implementation of Broadcast and Global Combine Operations Using the Postal Model
IEEE Transactions on Parallel and Distributed Systems
On the power of segmenting and fusing buses
Journal of Parallel and Distributed Computing
Constructing Euclidean Minimum Spanning Trees and All Nearest Neighbors on Reconfigurable Meshes
IEEE Transactions on Parallel and Distributed Systems
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Fast, efficient mutual and self simulations for shared memory and reconfigurable mesh
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system
ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
A Flexible Class of Parallel Matrix Multiplication Algorithms
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
An efficient self-simulation algorithm for reconfigurable meshes
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Using bus linearization to scale the reconfigurable mesh
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
This paper deals with the ability of a model to adapt algorithm instances of different sizes to run on a given model size without significant loss of efficiency. The overhead in simulating a step of a large instance of the model on a smaller instance can quantify this ability. A reconfigurable mesh (R-Mesh) can use its bus structure as a computational resource, presenting an obstacle to efficiently scaling down algorithms to run on a smaller R-Mesh. We construct a scaling simulation of a Fusing-Restricted Reconfigurable Mesh (FR-Mesh), a version of the R-Mesh. The overhead of this simulation depends only on the simulating machine size and not on the simulated machine size. Previously, the R-Mesh was not known to admit such a simulation overhead without significantly reducing its computational power. The small overhead holds importance for flexibility in algorithm design and for running algorithms with various input sizes on an available model of given size. The results of this paper extend to a variety of concurrent write rules and also translate to an improved scaling simulation of an unrestricted R-Mesh.