
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
R. Miller, V.K. PrasannaKumar, D.I. Reisis, Q.F Stout, "Parallel Computations on Reconfigurable Meshes," IEEE Transactions on Computers, vol. 42, no. 6, pp. 678692, June, 1993.  
BibTex  x  
@article{ 10.1109/12.277290, author = {R. Miller and V.K. PrasannaKumar and D.I. Reisis and Q.F Stout}, title = {Parallel Computations on Reconfigurable Meshes}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {6}, issn = {00189340}, year = {1993}, pages = {678692}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.277290}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Parallel Computations on Reconfigurable Meshes IS  6 SN  00189340 SP678 EP692 EPD  678692 A1  R. Miller, A1  V.K. PrasannaKumar, A1  D.I. Reisis, A1  Q.F Stout, PY  1993 KW  parallel algorithms KW  complexity; reconfigurable meshes; model of computation; reconfigurable architectures; reconfigurability; PRAM; computational complexity; multiprocessor interconnection networks; parallel algorithms. VL  42 JA  IEEE Transactions on Computers ER   
The mesh with reconfigurable bus is presented as a model of computation. The reconfigurable mesh captures salient features from a variety of sources, including the CAAPP, CHiP, polymorphictorus network, and bus automation. It consists of an array of processors interconnected by a reconfigurable bus system that can be used to dynamically obtain various interconnection patterns between the processors. A variety of fundamental datamovement operations for the reconfigurable mesh are introduced. Based on these operations, algorithms that are efficient for solving a variety of problems involving graphs and digitized images are also introduced. The algorithms are asymptotically superior to those previously obtained for the aforementioned reconfigurable architectures, as well as to those previously obtained for the mesh, the mesh with multiple broadcasting, the mesh with multiple buses, the meshoftrees, and the pyramid computer. The power of reconfigurability is illustrated by solving some problems, such as the exclusive OR, more efficiently on the reconfigurable mesh than is possible on the programmable randomaccess memory (PRAM).
[1] C. R. Dyer, "A VLSI pyramid machine for hierarchical parallel image processing," inProc. IEEE Conf. Pattern Recognition Image Processing, 1981.
[2] S. L. Tanimoto, "A pyramidal approach to parallel processing," inProc. Int. Symp. Comput. Architecture, June 1983, pp .
[3] R. Miller and Q. F. Stout, "Data movement techniques for the pyramid computer,"SIAM J. Comput., vol. 16, pp. 3860, 1987.
[4] F. T. Leighton, "Parallel computations using mesh of trees," MIT, Cambridge, MA, Tech. Rep., 1982.
[5] D. Nath, F. N. Maheshwari, and P. C. P. Bhatt, "Efficient VLSI networks for parallel processing based on orthogonal trees,"IEEE Trans. Comput., 1983.
[6] Q. F. Stout, "Mesh connected computers with broadcasting,"IEEE Trans. Comput., vol. C32, pp. 826830, 1983.
[7] S. H. Bokhari, Finding maximum on an array processor with a global bus,IEEE Trans. Comput., vol. C33, no. 2, pp. 133139, Feb. 1984.
[8] V. K. PrasannaKumar and C. S. Raghavendra, "Array processor with multiple broadcasting," inProc. Annu. Symp. Computer Architecture, June 1985.
[9] Q. F. Stout, "Meshes with multiple buses," inProc. 27th IEEE Symp. Foundations Comput. Sci., 1986, pp. 264273.
[10] Hunt, "The ICL DAP and its application to image processing," inLanguages and Architectures for Image Processing, M. J. B. Duff and S. Levialdi, Eds. New York/London: Academic Press, 1981.
[11] L. Snyder, "Introduction to the configurable highly parallel computer,"Comput., vol. 15, no. 1, pp. 4756, Jan. 1982.
[12] A. Aggarwal, "Optimal bounds for finding maximum on array of processors withkglobal buses,"IEEE Trans. Comput., vol. C35, no. 1, pp. 6264, Jan. 1986.
[13] D. M. Champion and J. Rothstein, "Immediate parallel solution of the longest common subsequence problem," inProc. Int. Conf. Parallel Processing, Aug. 1987, pp. 7077.
[14] H. Li and M. Maresca, "Polymorphictorus network,"IEEE Trans. Comput., vol. 38, no. 9, pp. 13451351, Sept. 1989.
[15] J. D. Ullman,Computational Aspects of VLSI. New York: Computer Science Press, 1984.
[16] V. K. PrasannaKumar and D. Reisis, "Parallel image processing on enhanced arrays," inProc. Int. Conf. Parallel Processing, Aug. 1987, pp. 909912.
[17] M. Furst, J. Saxe, and M. Sipser, "Parity, circuits and polynomial time hierarchy," inProc. IEEE Symp. Found. Comput. Sci., Oct. 1981, pp. 260270.
[18] L. G. Valiant, "Parallelism in comparison problems,"SIAM J. Comput., vol. 3, 1975.
[19] R. E. Ladner and M. J. Fischer, "Parallel prefix computation,"J. ACM, vol. 27, no. 4, pp. 831838, Oct. 1980.
[20] D. Nassimi and S. Sahni, "Data broadcasting in SIMD computers,"IEEE Trans. Comput., vol. C30, no. 2, pp. 101107, Feb. 1981.
[21] V. K. PrasannaKumar and D. Reisis, "VLSI arrays with reconfigurable buses," Comput. Res. Inst., Univ. Southern CA, Los Angeles, Tech. Report CRI8748, Sept. 1987.
[22] R. Miller and Q. F. Stout, "Some graph and image processing algorithms for the hypercube," inProc. SIAM Conf. Hypercube Multiprocessor, 1987.
[23] Q. F. Stout, "Pyramid computer algorithms optimal for the worstcase," inParallel Computer Vision, L. Uhr, Ed. New York: Academic Press, 1987, pp. 147168.
[24] Y. Shiloach and U. Vishkin, "AO(logN) parallel connectivity algorithm,"J. Algorithms, vol. 3, 1982.
[25] D. S. Hirschberg, A. K. Chandra, and D. V. Sarwate, "Computing connected components on parallel computers,"Commun. Assoc. Comput. Mach., pp. 461464, 1979.
[26] S. E. Hambrusch and J. Simon, "Solving undirected graph problems on VLSI," Dept. Comput. Sci., PA State Univ., Univ. Park, PA, Tech. Rep. CS8123, 1981.
[27] C. Savage and J. Ja'Ja', "Fast, efficient parallel algorithms for some graph problems,"SIAM J. Comput., vol. 10, pp. 682691, 1981.
[28] M. Atallah and R. Kosaraju, "Graph problems on a mesh connected processor array,"J. Assoc. Comp. Mach., vol. 31, pp. 649667, 1983.
[29] J. G. Nash and D. B. Shu, "The image understanding architecture," inProc. 21st Annu. Asilomar Conf. Signals, Syst., Comput.(Monterey, CA), Nov. 1987.
[30] C. C. Weemset al., "The image understanding architecture,"Int. J. Comput. Vision, vol. 2, pp. 251282, 1989.
[31] H. Freeman and R. Shapira, "Determining the minimalarea enclosing rectangle for an arbitrary closed curve,"Commun. Assoc. Comput. Mach., vol. 18, pp. 409413, 1975.
[32] V. K. PrasannaKumar and M. Eshaghian, "Parallel geometric algorithms for digitized pictures on mesh of trees organization," inProc. Int. Conf. Parallel Processing, Aug. 1986, pp. 270273.
[33] H. M. Alnuweiri and V. K. PrasannaKumar, "Parallel architectures and algorithms for image component labeling," Inst. Robotics Intell. Syst., Tech. Rep. IRIS #253, May 1989.
[34] J. Ja'Ja' and V. K. Prasanna Kumar, "Information transfer in distributed computing with applications to VLSI,"J. ACM, Jan. 1984.
[35] J. Ja'Ja', V. K. PrasannaKumar and J. Simon, "Information transfer under different sets of protocols,"SIAM J. Comput., vol. 13, no. 4, pp. 840849, Nov. 1984.
[36] J.W. Jang and V. K. Prasanna, "An optimal sorting algorithm on reconfigurable mesh," Inst. Robotics Intell. Syst., Tech. Rep. IRIS#277, Aug. 1991.
[37] JW. Jang, H. Park and V. K. Prasanna, "A fast algorithm for computing histogram on reconfigurable mesh," Inst. Robotics Intell. Syst., Tech. Rep. IRIS#290, Feb. 1992.
[38] J.W. Jang, H. Park, and V. K. Prasanna, "An optimal multiplication algorithm on reconfigurable mesh," Inst. Robotics Intell. Syst., Tech. Rep. IRIS#294, Mar. 1992.
[39] D. Reisis, "An efficient convex hull computation on the reconfigurable mesh," inProc. Int. Parallel Processing Symp., 1992, pp. 142145.
[40] Y. BenAsher, D. Peleg, R. Ramaswami, and A. Schuster, "The power of reconfiguration,"J. Parallel Distributed Computing, pp. 139153, 1991.
[41] J. Jenq and S. Sahni, "Reconfigurable mesh algorithms for the area and perimeter of image components and histogramming," inProc. Int. Conf. Parallel Processing, 1991, pp. 280281.
[42] J. Jenq and S. Sahni, "Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching," inProc. Int. Parallel Processing Symp., 1991, pp. 208215.
[43] K. Nakano, T. Masuzawa, and N. Tokura, "A sublogarithmic time sorting algorithm on a reconfigurable mesh,"IEICE Trans., vol. E74, no. 11, pp. 38943901, Nov. 1991.
[44] B. F. Wang, G. H. Chen, and F. C. Lin, "Constant time sorting on a processor array with a reconfigurable bus systems,"Info. Processing Letts., pp. 187192, 1990.
[45] M. M. Eshaghian and V. K. PrasannaKumar, "VLSI electrooptical computers for signal and image processing," inProc. 3rd Int. Conf. Supercomputing, 1988.
[46] R. Miller, V. K. Prasanna Kumar, D. Reisis, and Q. F. Stout, "Meshes with reconfigurable buses," inProc. 5th MIT Conf. Advanced Res. VLSI(Cambridge, MA), 1988, pp. 163178.
[47] R. Miller and Q. F. Stout, "Geometric algorithms for digitized pictures on a meshconnected computer,"IEEE Trans. Pattern Analysis Mach. Intell., vol. PAMI7, pp. 216228, 1985.
[48] D. Reisis and V. K. Prasanna Kumar, "VLSI arrays with reconfigurable buses," inProc. Int. Conf. Supercomput.(Athens, Greece), June 1987.
[49] S. Olariu, J. Schwoing, and J. Zhang, "Fast Computer Vision Algorithms for Reconfigurable Meshes," in Proc. Int. Parallel Processing Symp., Mar. 1992, pp. 258261.