Constant time sorting on a processor array with a reconfigurable bus system
Information Processing Letters
Introduction to algorithms
Journal of Parallel and Distributed Computing
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
Sorting and computing convex hulls on processor arrays with reconfigurable bus systems
Information Sciences: an International Journal
An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh
Information Processing Letters
The complexity of reconfiguring network models
Information and Computation
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
P-bandwidth priority queues on reconfigurable tree of meshes
Journal of Parallel and Distributed Computing
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
An Optimal Multiplication Algorithm on Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Linear array with a reconfigurable pipelined bus system—concepts and applications
Information Sciences: an International Journal - special issue on parallel and distributed processing
New Number Representation and Conversion Techniques on Reconfigurable Mesh*
HIPC '98 Proceedings of the Fifth International Conference on High Performance Computing
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Several dynamic programming algorithms are considered which can be efficiently implemented using parallel networks with reconfigurable buses. The bit model of general reconfigurable meshes with directed links, common write, and unit-time delay for broadcasting is assumed. Given two sequences of length $m$ and $n$, respectively, their longest common subsequence can be found in constant time by an $O(mh)\times O(nh)$ directed reconfigurable mesh, where $h=\min\{m,n\}+1$. Moreover, given an $n$-node directed graph $G=(V,E)$ with (possibly negative) integer weights on its arcs, the shortest distances from a source node $v\in V$ to all other nodes can be found in constant time by an $O(n^2w)\times O(n^2w)$ directed reconfigurable mesh, where $w$ is the maximum arc weight.