An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes

A matrix A of size m/spl times/n containing items from a totally ordered universe is termed monotone if, for every i, j, 1/spl les/i 2. In case m=n/sup /spl epsiv// for some constant /spl epsiv/, (0</spl epsiv//spl les/1), our algorithm runs in O(log log n) time.

[1]  Stephan Olariu,et al.  Reconfigurable Buses with Shift Switching: Concepts and Applications , 1995, IEEE Trans. Parallel Distributed Syst..

[2]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[3]  Stephan Olariu,et al.  Data Movement Techniques on Reconfigurable Meshes, with Applications , 1994, Int. J. High Speed Comput..

[4]  Hossam A. ElGindy,et al.  Selection on the Reconfigurable Mesh , 1991, ICPP.

[5]  Alok Aggarwal,et al.  Applications of generalized matrix searching to geometric algorithms , 1990, Discret. Appl. Math..

[6]  Massimo Maresca,et al.  Polymorphic Processor Arrays , 1993, IEEE Trans. Parallel Distributed Syst..

[7]  David Peleg,et al.  The Power of Reconfiguration , 1991, J. Parallel Distributed Comput..

[8]  Alok Aggarwal,et al.  Notes on searching in multidimensional monotone arrays , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[9]  Jerome Rothstein.  Bus versus cellular automata, and ultimate limitations of parallel processing , 1988 .

[10]  Hungwen Li,et al.  Connection Autonomy in SIMD Computers: A VLSI Implementation , 1989, J. Parallel Distributed Comput..

[11]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[12]  Massimo Maresca,et al.  Hardware Suport for Fast Reconfigurability in Processor Arrays , 1993, ICPP.

[13]  Chi-Jen Lu,et al.  Constant Time Algorithms for the Transitive Closure Problem and Its Applications , 1990, ICPP.

[14]  Alok Aggarwal,et al.  Geometric applications of a matrix-searching algorithm , 1987, SCG '86.

[15]  Massimo Maresca,et al.  Virtual Parallelism Support in Reconfigurable Processor Arrays , 1993, J. Inf. Sci. Eng..

[16]  K. Hwang,et al.  Mesh-connected array processors with bypass capability for signal/image processing , 1988, [1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume I: Architecture Track.

[17]  Massimo Maresca,et al.  Polymorphic-Torus Network , 1989, IEEE Trans. Computers.

[18]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[19]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[20]  Gen-Huey Chen,et al.  Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems , 1990, IEEE Trans. Parallel Distributed Syst..

[21]  Jerome Rothstein.  Bus automata, brains, and mental models , 1988, IEEE Trans. Syst. Man Cybern..

[22]  Mikhail J. Atallah.  A Faster Parallel Algorithm for a Matrix Searching Problem , 1990, SWAT.

[23]  Dionysios I. Reisis,et al.  Parallel Computations on Reconfigurable Meshes , 1993, IEEE Trans. Computers.

[24]  Mikhail J. Atallah,et al.  Efficient Parallel Algorithms for String Editing and Related Problems , 1990, SIAM J. Comput..

[25]  Koji Nakano,et al.  A Bibliography of Published Papers on Dynamically Reconfigurable Architectures , 1995, Parallel Process. Lett..

[26]  Mikhail J. Atallah,et al.  An efficient parallel algorithm for the row minima of a totally monotone matrix , 1991, SODA '91.

[27]  Massimo Maresca,et al.  Polymorphic-Torus Architecture for Computer Vision , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[28]  David B. Shu,et al.  The Gated Interconnection Network for Dynamic Programming , 1988 .

[29]  A. Bonato,et al.  Graphs and Hypergraphs , 2022 .