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

Hussein Alnuweiri, V. K. Prasanna Kumar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

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 ≤ p ≤ n. The array model considered here is an abstraction of several linearly connected parallel computers that have been constructed recently. The authors present O(n2/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(n2) time, but require Ω(n2) 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(n2/p) time, for 1 ≤ p ≤ n.

Original languageEnglish
Title of host publicationProc CVPR 88 Comput Soc Conf on Comput Vision and Pattern Recognit
PublisherPubl by IEEE
Pages931-936
Number of pages6
ISBN (Print)0818608625
Publication statusPublished - 1 Dec 1988
Externally publishedYes

Fingerprint

Labeling

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Alnuweiri, H., & Prasanna Kumar, V. K. (1988). Optimal geometric algorithms on fixed-size linear arrays and scan line arrays. In Proc CVPR 88 Comput Soc Conf on Comput Vision and Pattern Recognit (pp. 931-936). Publ by IEEE.

Optimal geometric algorithms on fixed-size linear arrays and scan line arrays. / Alnuweiri, Hussein; Prasanna Kumar, V. K.

Proc CVPR 88 Comput Soc Conf on Comput Vision and Pattern Recognit. Publ by IEEE, 1988. p. 931-936.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Alnuweiri, H & Prasanna Kumar, VK 1988, Optimal geometric algorithms on fixed-size linear arrays and scan line arrays. in Proc CVPR 88 Comput Soc Conf on Comput Vision and Pattern Recognit. Publ by IEEE, pp. 931-936.
Alnuweiri H, Prasanna Kumar VK. Optimal geometric algorithms on fixed-size linear arrays and scan line arrays. In Proc CVPR 88 Comput Soc Conf on Comput Vision and Pattern Recognit. Publ by IEEE. 1988. p. 931-936
Alnuweiri, Hussein ; Prasanna Kumar, V. K. / Optimal geometric algorithms on fixed-size linear arrays and scan line arrays. Proc CVPR 88 Comput Soc Conf on Comput Vision and Pattern Recognit. Publ by IEEE, 1988. pp. 931-936
@inproceedings{5e96810d558444fea530bff8165688dc,
title = "Optimal geometric algorithms on fixed-size linear arrays and scan line arrays.",
abstract = "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 ≤ p ≤ n. The array model considered here is an abstraction of several linearly connected parallel computers that have been constructed recently. The authors present O(n2/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(n2) time, but require Ω(n2) 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(n2/p) time, for 1 ≤ p ≤ n.",
author = "Hussein Alnuweiri and {Prasanna Kumar}, {V. K.}",
year = "1988",
month = "12",
day = "1",
language = "English",
isbn = "0818608625",
pages = "931--936",
booktitle = "Proc CVPR 88 Comput Soc Conf on Comput Vision and Pattern Recognit",
publisher = "Publ by IEEE",

}

TY - GEN

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

AU - Alnuweiri, Hussein

AU - Prasanna Kumar, V. K.

PY - 1988/12/1

Y1 - 1988/12/1

N2 - 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 ≤ p ≤ n. The array model considered here is an abstraction of several linearly connected parallel computers that have been constructed recently. The authors present O(n2/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(n2) time, but require Ω(n2) 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(n2/p) time, for 1 ≤ p ≤ n.

AB - 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 ≤ p ≤ n. The array model considered here is an abstraction of several linearly connected parallel computers that have been constructed recently. The authors present O(n2/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(n2) time, but require Ω(n2) 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(n2/p) time, for 1 ≤ p ≤ n.

UR - http://www.scopus.com/inward/record.url?scp=0024128209&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024128209&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0024128209

SN - 0818608625

SP - 931

EP - 936

BT - Proc CVPR 88 Comput Soc Conf on Comput Vision and Pattern Recognit

PB - Publ by IEEE

ER -