Array processor with multiple broadcasting
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
Constant time sorting on a processor array with a reconfigurable bus system
Information Processing Letters
Efficient histogramming on hypercube SIMD machines
Computer Vision, Graphics, and Image Processing
Meshes with reconfigurable buses
Proceedings of the fifth MIT conference on Advanced research in VLSI
Information Processing Letters
Journal of Parallel and Distributed Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
Fast computer vision algorithms for reconfigurable meshes
Image and Vision Computing
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
Sorting on a mesh-connected parallel computer
Communications of the ACM
On Computing Complete Histograms of Images in Log (n) Steps Using Hypercubes
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Parallel and Distributed Systems
Histogramming on a Reconfigurable Mesh Computer
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
An Optimal Sorting Algorithm on Reconfigurable Mesh
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Virtual Computer Corporation: Transformable Computers
Proceedings of the 8th International Symposium on Parallel Processing
Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
Optimal Algorithms for the Multiple Query Problem on Reconfigurable Meshes, with Applications
IEEE Transactions on Parallel and Distributed Systems
The spin-wave nanoscale reconfigurable mesh and the labeling problem
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Fast Image Mosaicing Based on Histograms
IEICE - Transactions on Information and Systems
| Hi-index | 0.14 |
The reconfigurable mesh captures salient features from a variety of sources, including the CAAPP, the CHiP, the polymorphic-torus network and the bus automaton. It consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns between the processors. In this paper, we present a fast algorithm for computing the histogram of an N脳N image with h grey levels in$$O\!\!\left({\bf min}\!\left\{\sqrt h + {\bf log^*} (N/h), N\right\}\!\right)$$time on an N脳N reconfigurable mesh assuming each PE has a constant amount of local memory. This algorithm runs on the PARBUS and MRN/LRN models. In addition, histogram modification can be performed in $O(\sqrt h)$ time on the same model.A variant of our algorithm runs in$$O\!\!\left({\bf min}\!\left\{\sqrt {\bf h} + {\bf log\ log} (N/h), N\right\}\!\right)$$time on an N脳N RMESH in which each PE has constant storage. This result improves the known time and memory bounds for histogramming on the RMESH model.