Optimal geometric algorithms on fixed-size linear arrays and scan line arrays

Optimal parallel solutions are presented to several geometric problems on an n*n image on a fixed-size linear array with p processors, where 1<or=p<or=n. The array model considered here is an abstraction of several linearly connected parallel computers that have been constructed recently. The authors present O(n/sup 2//p) time solutions to several geometric problems which require global transfer of information such as labeling connected regions, computing the convexity and intersections of multiple regions, and computing several distance functions. All the solutions are optimal in the sense that their processor-time product is equal to the sequential complexity of the problems. Limitations of linear arrays in image computations are also discussed by showing that there are certain image problems which can be solved sequentially in O(n/sup 2/) time, but require Omega (n/sup 2/3) time on a linear array, irrespective of the number of processors used and the way in which the input image is partitioned among the processors. The authors also show alternate fixed-size array organizations with p processors which can solve the above problems in O(n/sup 2//p) time, for 1<or=p<or=n.<<ETX>>

[1]  Jorge L. C. Sanz,et al.  P3E: New Life for Projection-Based Image Processing , 1987, J. Parallel Distributed Comput..

[2]  Sartaj Sahni,et al.  Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer , 1980, SIAM J. Comput..

[3]  H. T. Kung.  Systolic algorithms for the CMU warp processor , 1984 .

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

[5]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[6]  Viktor K. Prasanna,et al.  Information Transfer in Distributed Computing with Applications to VLSI , 1984, JACM.

[7]  Sartaj Sahni,et al.  Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.

[8]  Allan L. Fisher.  Scan line array processors for image computation , 1986, ISCA 1986.

[9]  Dionysios I. Reisis,et al.  Parallel Image Processing On Enhanced Arrays , 1987, ICPP.

[10]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

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

[12]  Viktor K. Prasanna,et al.  An efficient VLSI architecture with applications to geometric problems , 1989, Parallel Comput..

[13]  I. V. Ramakrishnan,et al.  Modular Matrix Multiplication on a Linear Array , 1984, IEEE Trans. Computers.

[14]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[15]  Gérard M. Baudet,et al.  Optimal Sorting Algorithms for Parallel Computers , 1978, IEEE Transactions on Computers.

[16]  F. Frances Yao,et al.  Finding the Convex Hull of a Simple Polygon , 1983, J. Algorithms.

[17]  Azriel Rosenfeld,et al.  Parallel Image Processing Using Cellular Arrays , 1983, Computer.

[18]  KSHITIJ A. DOSHI,et al.  Optimal Graph Algorithms on a Fixed-Size Linear Array , 1987, IEEE Transactions on Computers.