### Abstract

Linear arrays are characterized by a small communication bandwidth and a large communication diameter rendering them unsuited to the implementation of global computations. This paper presents efficient data movement and partitioning techniques to overcome several shortcomings of linear arrays. These techniques are used to derive optimal parallel algorithms for several geometric problems on n×n images using a fixed-size linear array with p processors, where 1≤p≤n. O(n^{2}/p) time solutions are presented for labeling connected image regions, computing the convex hull of each region, and computing nearest neighbors. Consequently, a linear array with n processors can solve several image problems in O(n) time which is the same time taken by a two dimensional mesh-connected computer with n^{2} processors. Limitations of linear arrays are analyzed by presenting a class of image problems which can be solved sequentially in O(n)^{2}) time, but require Ω(n^{2}) time on a linear array, irrespective of the number of processors used and the partitioning of the input image among the processors. An alternate communication-efficient fixed-size organization with p processors is proposed to solve such problems in O(n^{2}/p) time, for 1≤p≤n.

Original language | English |
---|---|

Pages (from-to) | 55-65 |

Number of pages | 11 |

Journal | Distributed Computing |

Volume | 5 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1 Sep 1991 |

### Fingerprint

### Keywords

- Image processing
- Linear arrays
- Optimal algorithms

### ASJC Scopus subject areas

- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Computational Theory and Mathematics

### Cite this

*Distributed Computing*,

*5*(2), 55-65. https://doi.org/10.1007/BF02259747