Abstract
Reconfigurable mesh (RMESH) algorithms for several fundamental operations are developed. These operations include data broadcast, prefix sum, data sum, ranking, shift, data accumulation, consecutive sum, adjacent sum, sorting, random access read, and random access write.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Beame and J. Hastad, “Optimal bounds for decision problems on the CRCW PRAM”, Proc. 19th ACM Symp. on Theo, of Computing, 83–93, 1987.
Y. Ben-Asher, D. Peleg, R. Ramaswami, and A. Schuster, “The power of reconfiguration,” Research Report, The Hebrew University, Israel, 1990.
E. Horowitz and S. Sahni, Fundamentals of data structures in Pascal, Third Edition, Computer Science Press, Inc., New York, 1990.
J. Jang and V. Prasanna, “An optimal sorting algorithm on reconfigurable meshes”, Proceedings 6th International Parallel Processing Symposium, IEEE Computer Society Press, 130–137, 1992.
J. Jenq and S. Sahni, “Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching,” Proceedings 5th International Parallel Processing Symposium, IEEE Computer Society Press, 208–215, 1991.
J. Jenq and S. Sahni, “Reconfigurable mesh algorithms for the Hough transform,” Proc. 1991 International Conference on Parallel Processing, The Pennsylvania State University Press, 34–41, 1991.
J. Jenq and S. Sahni, “Reconfigurable mesh algorithms for the area and perimeter of image components,” Proc. 1991 International Conference on Parallel Processing, The Pennsylvania State University Press, 280–281, 1991.
T. Leighton, “Tight bounds on the complexity of parallel sorting”, IEEE Trans. on Computers, C-34, 4, April 1985, pp 344–354.
H. Li and M. Maresca, “Polymorphic-torus architecture for computer vision,” IEEE Trans, on Pattern & Machine Intelligence, 11, 3, 133–143, 1989.
H. Li and M. Maresca, “Polymorphic-torus network”, IEEE Trans, on Computers, C-38, 9, 1345–1351, 1989.
R. Lin, S. Olariu, J. Schwing, and J. Zhang, “Sorting in O(1) time on an n×n reconfigurable mesh”, Technical Report, Old Dominion University, Virginia.
R. Miller, V. K. Prasanna Kumar, D. Resis and Q. Stout, “Data movement operations and applications on reconfigurable VLSI arrays”, Proceedings of the 1988 International Conference on Parallel Processing, The Pennsylvania State University Press, pp 205–208.
R. Miller, V. K. Prasanna Kumar, D. Resis and Q. Stout, “Meshes with reconfigurable buses”, Proceedings 5th MIT Conference On Advanced Research IN VLSI, 1988, pp 163–178.
R. Miller, V. K. Prasanna Kumar, D. Resis and Q. Stout, “Image computations on reconfigurable VLSI arrays”, Proceedings IEEE Conference On Computer Vision And Pattern Recognition, 1988, pp 925–930.
R. Miller, V. K. Prasanna Kumar, D. Resis and Q. Stout, “Image processing on reconfigurable meshes,” in From Pixels to Features II, Elsevier Science, H. Burkhardt, ed., 1991.
R. Miller, V. K. Prasanna Kumar, D. Resis and Q. Stout, “Efficient parallel algorithms for intermediate-level vision analysis on the reconfigurable mesh,” in Parallel Algorithms and Architectures for Image Understanding, ed. V. Prasanna Kumar, Academic Press, 1991.
D. Nassimi and S. Sahni, “Bitonic sort on a mesh connected parallel computer”, IEEE Transactions on Computers, vol C-27, no. 1, Jan. 1979, pp 2–7.
D. Nassimi and S. Sahni, “Data broadcasting in SIMD computers”, IEEE Transactions on Computers, vol C-30, no. 2, Feb. 1981, pp 101–107.
M. Nigam and S. Sahni, “Sorting n numbers onn×n reconfigurable meshes with buses’” Technical Report, University of Florida, revised, 1992.
S. Ranka and S. Sahni, Hypercube algorithms with Applications to Image Processing and Pattern Recognition, Springer Verlag, 1990.
H. J. Siegel, L. Siegel, F. C. Kemmerer, P. T. Muller, H. E. Smalley, and S. D. Smith “PASM: A partitionable SIMD/MIMD system for image processing and pattern recognition”, IEEE Transactions on computers, vol. C-30, no. 12, Dec. 1981, pp 934–947.
B. Wang and G. Chen, “Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems,” IEEE Trans, on Parallel and Distributed Systems, 1, 4, 500–507, 1990.
B. Wang, G. Chen, and and F. Lin, “Constant time sorting on a processor array with a reconfigurable bus system,” Info. Proc. Letrs., 34, 4, 187–190, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jenq, JF., Sahni, S. (1993). Reconfigurable Mesh Algorithms For Fundamental Data Manipulation Operations. In: Özgüner, F., Erçal, F. (eds) Parallel Computing on Distributed Memory Multiprocessors. NATO ASI Series, vol 103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58066-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-58066-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63460-4
Online ISBN: 978-3-642-58066-6
eBook Packages: Springer Book Archive