An efficient algorithm for row minima computations on basic reconfigurable meshes

IEEE Transactions on Parallel and Distributed Systems

Volumn 9, Issue 6, 1998, Pages 561-569

  Nakano, Koji ^a,c   Olariu, Stephan ^b,c  

^a NAGOYA INSTITUTE OF TECHNOLOGY   (Japan)

^b Old Dominion University   (United States)

^c IEEE   (Japan)

Author keywords

Basic reconfigurable meshes; Cellular system design; Facility location problems; Monotone matrices; Reconfigurable meshes; Row minima; Search problems; Totally monotone matrices; VLSI design

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA;

BASIC RECONFIGURABLE MESHES; MONOTONE MATRICES;

VLSI CIRCUITS;

EID: 0032097903     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.689443     Document Type: Article

References (31)

1. A. Aggarwal and M.M. Klawe," Applications of Generalized Matrix Searching to Geometric Problems," Discrete Applied Mathematics, vol. 27, pp. 3-23, 1990.
2. A. Aggarwal, M.M. Klawe, S. Moran, P. Shor, and R. Wilber, "Geometric Applications of a Matrix-Searching Algorithm," Algorithmica, vol. 2, pp. 195-208, 1987.
3. A. Aggarwal and J. Park, "Notes on Searching in Multidimensional Monotone Arrays," Proc. 29th Ann. Symp. Foundations of Computer Science, pp. 497-512, 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. 968-988, 1990.
5. M.J. Atallah, "A Faster Parallel Algorithm for a Matrix Searching Problem," Algorithmica, vol. 9, pp. 156-167, 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. 394-413, 1992.
7. Y. Ben-Asher, D. Peleg, R. Ramaswani, and A. Schuster, "The Power of Reconfiguration," J. Parallel and Distributed Computing, vol. 13, pp. 139-153, 1991.
8. C. Berge, Graphs and Hypergraphs, pp. 280-282. Amsterdam: North-Holland, 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. Mackenzie, and Q.F. Stout, "Selection on the Reconfigurable Mesh," Proc. Fourth Symp. Frontiers of Massively Parallel Computation, pp. 38-45, McLean, Va., Oct. 1992.
11. J. JáJá, An Introduction to Parallel Algorithms, pp. 188-189. Reading, Mass.: Addison Wesley, 1992.
12. D. Kim and K. Hwang, "Mesh-Connected Array Processors with Bypass Capability for Signal/Image Processing," Proc. Hawaii Conf. System Sciences, Maui, Hawaii, Jan. 1988.
13. H. Li and M. Maresca, "Polymorphic-Torus Network," IEEE Trans. Computers, vol. 38, pp. 1,345-1,351, 1989.
14. H. Li and M. Maresca, "Polymorphic-Torus Architecture for Computer Vision," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 233-243, 1989.
15. R. Lin and S. Olariu, "Reconfigurable Buses with Shift Switching-Concepts and Applications," IEEE Trans. Parallel and Distributed Systems, vol. 6, pp. 93-102, 1995.
16. M. Maresca, "Polymorphic Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 490-506, 1993.
17. M. Maresca and H. Li, "Connection Autonomy in SIMD Computers: A VLSI Implementation," J. Parallel and Distributed Computing, vol. 7, pp. 302-320, 1989.
18. M. Maresca and H. Li, "Virtual Parallelism Support in Reconfigurable Processor Arrays," UCB-ICSI Technical Report 91-041, Univ. of California at Berkeley, July 1991.
19. M. Maresca and H. Li, "Hierarchical Node Clustering in Polymorphic Processor Arrays," UCB-ICSI Technical Report 91-042, 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. 282-289, St. Charles, Ill., 1993.
21. R. Miller, V.K.P. Kumar, D. Reisis, and Q.F. Stout, "Parallel Computations on Reconfigurable Meshes," IEEE Trans. Computers, vol. 42, pp. 678-692, 1993.
22. K. Nakano, "A Bibliography of Published Papers on Dynamically Reconfigurable Architectures," Parallel Processing Letters, vol. 5, pp. 111-124, 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. 311-323, 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. 811-820, 1991.
25. J. Rothstein, "On the Ultimate Limitations of Parallel Processing," Proc. Int'l Conf. Parallel Processing, pp. 206-212, 1976.
26. J. Rothstein, "Bus Automata, Brains, and Mental Models," IEEE Trans. Systems, Man, and Cybernetics, vol. 18, pp. 522-531, 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. 348-355, 1975.
30. B.F. Wang and G.H. Chen, "Constant Time Algorithms for the Transitive Closure Problem and Its Applications," IEEE Trans. Parallel and Distributed Systems, vol. 1, pp. 500-507, 1990.
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. 251-282, 1989.