A Computational Paradigm on Network-Based Models of Computation

A COMPUTATIONAL PARADIGM ON NETWORK-BASED MODELS OF COMPUTATION Venkatavasu Bokka Old Dominion University, 1996 Advisors: Drs. Stephan Olariu and James L. Schwing The maturation of computer science has strengthened the need to consolidate isolated algorithms and techniques into general computational paradigms. The main goal of this dissertation is to provide a unifying framework which captures the essence of a number of problems in seemingly unrelated contexts in database design, pattern recognition, image processing, VLSI design, computer vision, and robot navigation. The main contribution of this work is to provide a computational paradigm which involves the unifying framework, referred to as the Multiple Query problem, along with a generic solution to the Multiple Query problem. To demonstrate the applicability of the paradigm, a number of problems from different areas of computer science are solved by formulating them in this framework. Also, to show practical relevance, two fundamental problems were implemented in the C language using MPI. The code can be ported onto many commercially available parallel computers; in particular, the code was tested on an IBM-SP2 and on a network of workstations. Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. Copyright by Venkatavasu Bokka 1996 Reproduced with permission of the copyright owner. Further reproduction prohibited without permission.

[1]  Hideyuki Tamura,et al.  Image database systems: A survey , 1984, Pattern Recognit..

[2]  Stephan Olariu,et al.  Fast computer vision algorithms for reconfigurable meshes , 1992, Image Vis. Comput..

[3]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[4]  Inan Stojarenovi,et al.  Computational Geometry on a Hyper,cube , 2022 .

[5]  Laxmi N. Bhuyan,et al.  High-performance computer architecture , 1995, Future Gener. Comput. Syst..

[6]  Ileana Streinu,et al.  A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines , 1995, Inf. Process. Lett..

[7]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[8]  Ivan Stojmenovic,et al.  Time-Optimal Nearest-Neighbor Computations on Enhanced Meshes , 1996, J. Parallel Distributed Comput..

[9]  T H Merrett,et al.  Relational Information Systems , 1983 .

[10]  Stephen A. Cook,et al.  Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes , 1986, SIAM J. Comput..

[11]  Richard Cole,et al.  Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms , 1987, FOCS.

[12]  Dionysios I. Reisis,et al.  Image Computations on Meshes with Multiple Broadcast , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Donald B. Johnson,et al.  Generalized Selection and Ranking: Sorted Matrices , 1984, SIAM J. Comput..

[14]  Afonso Ferreira,et al.  The Complexity of Searching in X+Y and Other Multisets , 1990, Inf. Process. Lett..

[15]  Kenneth E. Batcher,et al.  Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.

[16]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[17]  Jack Sklansky,et al.  Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.

[18]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[19]  Amotz Bar-Noy,et al.  Square meshes are not always optimal , 1989, SPAA '89.

[20]  Ramesh Subramonian,et al.  LogP: towards a realistic model of parallel computation , 1993, PPOPP '93.

[21]  E. F. Codd,et al.  Cellular automata , 1968 .

[22]  Richard Cole,et al.  Optimal parallel algorithms for polygon and point-set problems , 1988, SCG '88.

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

[24]  Azriel Rosenfeld,et al.  Parallel Image Processing by Memory-Augmented Cellular Automata , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  Herbert Freeman,et al.  Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.

[26]  Bernard Chazelle.  Computational Geometry on a Systolic Chip , 1984, IEEE Transactions on Computers.

[27]  Afonso Ferreira,et al.  Parallel Algorithms for Searching In X+Y , 1989, ICPP.

[28]  Stephan Olariu,et al.  A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications , 1994, J. Parallel Distributed Comput..

[29]  Quentin F. Stout,et al.  Practical hypercube algorithms for computational geometry , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[30]  Andranik Mirzaian.  Channel routing in VLSI , 1984, STOC '84.

[31]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.

[32]  Selim G. Akl,et al.  Parallel computational geometry , 1992 .

[33]  Azriel Rosenfeld,et al.  Picture Processing by Computer , 1969, CSUR.

[34]  Viktor K. Prasanna,et al.  Array Processor with Multiple Broadcasting , 1985, ISCA.

[35]  Stephan Olariu,et al.  A Unifying Look at Semigroup Computations on Meshes with Multiple Broadcasting , 1993, Parallel Process. Lett..

[36]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

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

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

[39]  Selim G. Akl,et al.  Parallel Binary Search , 1990, IEEE Trans. Parallel Distributed Syst..

[40]  Afonso G. Ferreira.  Parallel search in sorted multisets, and NP-complete problems , 1992 .

[41]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[42]  Stephan Olariu,et al.  A Fast Selection Algorithm for Meshes with Multiple Broadcasting , 1994, IEEE Trans. Parallel Distributed Syst..

[43]  Russ Miller,et al.  Mesh Computer Algorithms for Line Segments and Simple Polygons , 1987, ICPP.

[44]  Zhaofang Wen,et al.  Parallel multiple search , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[45]  H. Gurla,et al.  Visibility-related problems on parallel computational models , 1996 .

[46]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[47]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[48]  Mikhail J. Atallah,et al.  On the parallel decomposability of geometric problems , 1989, SCG '89.

[49]  D. Parkinson,et al.  The AMT DAP 500 , 1988, Digest of Papers. COMPCON Spring 88 Thirty-Third IEEE Computer Society International Conference.

[50]  Thomas H. Payne,et al.  Sorting X + Y , 1975, Commun. ACM.

[51]  Wen-Tsuen Chen,et al.  Efficient Medain Finding and Its Application to Two-Variable Linear Programming on Mesh-Connected Computers with Multiple Broadcasting , 1992, J. Parallel Distributed Comput..

[52]  Ivan Stojmenovic,et al.  Time-optimal proximity algorithms on meshes with multiple broadcasting , 1994, Proceedings of 8th International Parallel Processing Symposium.

[53]  Jang-Ping Sheu,et al.  Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting , 1990, IEEE Trans. Parallel Distributed Syst..

[54]  Jeffrey Scott Vitter,et al.  Optimal cooperative search in fractional cascaded data structures , 1990, SPAA '90.

[55]  A. A. Mullin,et al.  Principles of neurodynamics , 1962 .

[56]  Jingyuan Zhang,et al.  Convex Polygon Problems on Meshes with Multiple Broadcasting , 1992, Parallel Process. Lett..

[57]  A. Horn,et al.  Fractal graphics and image compression on a SIMD processor , 1988, Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation.

[58]  Selim G. Akl,et al.  EFFICIENT CONVEX HULL ALGORITHMS FOR PATTERN RECOGNITION APPLICATIONS. , 1979 .

[59]  Michael T. Goodrich,et al.  Triangulating a Polygon in Parallel , 1989, J. Algorithms.

[60]  Stephan Olariu,et al.  Optimal convex hull algorithms on enhanced meshes , 1993, BIT Comput. Sci. Sect..

[61]  Jean-Paul Laumond,et al.  Obstacle Growing in a Nonpolygonal World , 1987, Inf. Process. Lett..

[62]  John H. Reif,et al.  Randomized algorithms for binary search and load balancing with geometric applications , 1990, SPAA '90.

[63]  Mikhail J. Atallah,et al.  Efficient plane sweeping in parallel , 1986, SCG '86.

[64]  Sartaj Sahni,et al.  Bitonic Sort on a Mesh-Connected Parallel Computer , 1979, IEEE Transactions on Computers.

[65]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[66]  Russ Miller,et al.  Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[67]  Shahid H. Bokhari,et al.  Finding Maximum on an Array Processor with a Global Bus , 1984, IEEE Transactions on Computers.

[68]  Stephan Olariu,et al.  Simulating Enhanced Meshes, with Applications , 1993, Parallel Process. Lett..

[69]  Russ Miller,et al.  Mesh Computer Algorithms for Computational Geometry , 1989, IEEE Trans. Computers.

[70]  Franco P. Preparata,et al.  Computational Geometry , 1985, Texts and Monographs in Computer Science.