Short communicationApplications of reconfigurable meshes to constant-time computations☆
References (12)
- et al.
Connection autonomy and SIMD computers: a VLSI implementation
J. Parallel Distributed Comput.
(1989) - et al.
Constant Time Sorting on a processing array with a reconfigurable bus system
Inform. Process. Lett.
(1990) The Design and Analysis of Parallel Algorithms
(1989)- et al.
Efficient parallel algorithms for graph problems
Algorithmica
(1990) - et al.
Polymorphic-torus network
IEEE Trans. Comput.
(1989) - et al.
Polymorphic-torus architecture for computer vision
IEEE Trans. Pattern Analysis Machine Intelligence
(1989)
There are more references available in the full text version of this article.
Cited by (10)
Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses
1998, Journal of AlgorithmsSimulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures
1997, Information and ComputationA constant time algorithm for theorem proving in propositional logic on reconfigurable meshes
1995, Information SciencesRelating two-dimensional reconfigurable meshes with optically pipelined buses
2000, International Journal of Foundations of Computer ScienceReconfigurable mesh techniques and applications
2008, Proceedings of the 2008 International Conference on Engineering of Reconfigurable Systems and Algorithms, ERSA 2008Dynamic reconfiguration on the R-mesh
2007, Handbook of Parallel Computing: Models, Algorithms and Applications
- ☆
This work was supported by NASA under grant NCCl-99.
- ∗∗
Additional support by the National Science Foundation under grant CCR-8909996 is gratefully acknowledged.
Copyright © 1993 Published by Elsevier B.V.