
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Koji Nakano, Stephan Olariu, "An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 6, pp. 561569, June, 1998.  
BibTex  x  
@article{ 10.1109/71.689443, author = {Koji Nakano and Stephan Olariu}, title = {An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {6}, issn = {10459219}, year = {1998}, pages = {561569}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.689443}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes IS  6 SN  10459219 SP561 EP569 EPD  561569 A1  Koji Nakano, A1  Stephan Olariu, PY  1998 KW  Monotone matrices KW  totally monotone matrices KW  search problems KW  row minima KW  reconfigurable meshes KW  basic reconfigurable meshes KW  VLSI design KW  facility location problems KW  cellular system design. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—A matrix
[1] A. Aggarwal and M.M. Klawe, "Applications of Generalized Matrix Searching to Geometric Problems," Discrete Applied Mathematics, vol. 27, pp. 323, 1990.
[2] A. Aggarwal, M.M. Klawe, S. Moran, P. Shor, and R. Wilber, "Geometric Applications of a MatrixSearching Algorithm," Algorithmica, vol. 2, pp. 195208, 1987.
[3] A. Aggarwal and J. Park, "Notes on Searching in Multidimensional Monotone Arrays," Proc. 29th Ann. Symp. Foundations of Computer Science, pp. 497512, Oct. 1988.
[4] A. Apostolico, M.J. Atallah, L.L. Larmore, and S. McFaddin, "Efficient Parallel Algorithms for String Editing and Related Problems," SIAM J. Computing, vol. 19, pp. 968988, 1990.
[5] M.J. Atallah, "A Faster Parallel Algorithm for a Matrix Searching Problem," Algorithmica, vol. 9, pp. 156167, 1993.
[6] M.J. Atallah and S.R. Kosaraju, "An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix," J. Algorithms, vol. 13, pp. 394413, 1992.
[7] Y. BenAsher,D. Peleg,R. Ramaswami,, and A. Schuster,“The power of reconfiguration,” J. of Parallel and Distributed Computing, vol. 13, no. 2, pp. 139153, Oct. 1991.
[8] C. Berge, Graphs and Hypergraphs, pp. 280282.Amsterdam: NorthHolland, 1973.
[9] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis.New York: Wiley and Sons, 1973.
[10] E. Hao, P.D. MacLenzie, and Q.F. Stout, "Selection on the Reconfigurable Mesh," Proc. Fourth Symp. Frontiers of Massively Parallel Computation, pp. 3845, 1992.
[11] J. J'aJ'a, An Introduction to Parallel Algorithms.New York: AddisonWesley, 1992.
[12] D. Kim and K. Hwang, "MeshConnected Array Processors with Bypass Capability for Signal/Image Processing," Proc. Hawaii Conf. System Sciences,Maui, Hawaii, Jan. 1988.
[13] H. Li and M. Maresca,“Polymorphictorus network,” IEEE Trans. on Computers, vol. 38, no. 9, pp. 13451351, Sept. 1989.
[14] H. Li and M. Maresca, "PolymorphicTorus Architecture for Computer Vision," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 3, pp. 233243, Mar. 1989.
[15] R. Lin and S. Olariu, "Reconfigurable Buses with Shift Switching: Concepts and Applications," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 1, pp. 93102, Jan. 1995.
[16] M. Maresca, "Polymorphic Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 490506, 1993.
[17] M. Maresca and H. Li,“Connection autonomy in SIMD computers: a VLSI implementation,”J. Parallel Distribut. Comput., vol. 7, pp. 302–320, 1989.
[18] M. Maresca and H. Li, "Virtual Parallelism Support in Reconfigurable Processor Arrays," UCBICSI Technical Report 91041, Univ. of California at Berkeley, July 1991.
[19] M. Maresca and H. Li, "Hierarchical Node Clustering in Polymorphic Processor Arrays," UCBICSI Technical Report 91042, Univ. of California at Berkeley, July 1991.
[20] M. Maresca, H. Li, and P. Baglietto, "Hardware Support for Fast Reconfigurability in Processor Arrays," Proc. Int'l Conf. Parallel Processing, vol. I, pp. 282289,St. Charles, Ill., 1993.
[21] R. Miller,V.K. Prasanna Kumar,D.I. Reisis, and Q.F. Stout,“Parallel computations on reconfigurable meshes,” IEEE Trans. on Computers, pp. 678692, June 1993.
[22] K. Nakano, "A Bibliography of Published Papers on Dynamically Reconfigurable Architectures," Parallel Processing Letters, vol. 5, pp. 111124, 1995.
[23] S. Olariu, J.L. Schwing, and J. Zhang, "Fundamental Data Movement on Reconfigurable Meshes," Int'l J. High Speed Computing, vol. 6, pp. 311323, 1994.
[24] S. Olariu, J.L. Schwing, and J. Zhang, "Fundamental Algorithms on Reconfigurable Meshes," Proc. 29th Ann. Allerton Conf. Comm., Control, and Computing, pp. 811820, 1991.
[25] J. Rothstein, "On the Ultimate Limitations of Parallel Processing," Proc. Int'l Conf. Parallel Processing, pp. 206212, 1976.
[26] J. Rothstein,“Bus Automata, Brains, and Mental Models,” IEEE Trans. on Systems, Man, and Cybernetics, vol. 18, no. 4, pp. 522531, Apr. 1988.
[27] D.B. Shu, L.W. Chow, and J.G. Nash, "A Content Addressable, Bit Serial Associate Processor," Proc. IEEE Workshop VLSI Signal Processing,Monterey, Calif., Nov. 1988.
[28] D.B. Shu and J.G. Nash, "The Gated Interconnection Network for Dynamic Programming," Concurrent Computations, S.K. Tewsburg et al., eds. Plenum Publishing, 1988.
[29] L.G. Valiant, "Parallelism in Comparison Problems," SIAM J. Computing, vol. 4, pp. 348355, 1975.
[30] B. F. Wang and G. H. Chen,“Constant time algorithms for the transitive closure problem and some related graph problems on processor arrays with reconfigurable bus systems,” IEEE Trans. on Parallel and Distributed Systems, vol. 1, no. 4, pp. 500507, 1991.
[31] C.C. Weems, S.P. Levitan, A.R. Hanson, E.M. Riseman, J.G. Nash, and D.B. Sheu, "The Image Understanding Architecture," Int'l J. Computer Vision, vol. 2, pp. 251282, 1989