An efficient self-simulation algorithm for reconfigurable meshes

Authors:
Susumu Matsumae;Nobuki Tokura
Affiliations:
Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka 560-8531, Japan;Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka 560-8531, Japan
Venue:
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Year:
2000

Citing 13
Cited 0

Array processor with multiple broadcasting

Journal of Parallel and Distributed Computing
The power of reconfiguration

Journal of Parallel and Distributed Computing
Parallel Computations on Reconfigurable Meshes

IEEE Transactions on Computers
Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses

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
Optimal algorithms for constrained reconfigurable meshes

Journal of Parallel and Distributed Computing
Time-Optimal Domain-Specific Querying on Enhanced Meshes

IEEE Transactions on Parallel and Distributed Systems
Scaling Simulation of the Fusing-Restricted Reconfigurable Mesh

IEEE Transactions on Parallel and Distributed Systems
Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems

IEEE Transactions on Parallel and Distributed Systems
Polymorphic Processor Arrays

IEEE Transactions on Parallel and Distributed Systems
Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses

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

Quantified Score

Hi-index	0.01

Visualization

Abstract

A reconfigurable mesh (RM) is the two-dimensional mesh-connected computer enhanced with a reconfigurable bus system. The bus system is used to dynamically obtain various interconnection patterns among the processors during the execution of programs. This paper shows that the RM of size n × n can be simulated in O(n2/m2 log n) steps by the RM of smaller size m × m (m n). The algorithm improves the previously known best results, O (n2/m2 log m log n / m) steps proposed by Fernández-Zepeda et al., under some conditions (e.g. m = nc for a constant c with 0 c linear RM, which is a simpler model than that used by Fernández-Zepeda et al.