Parallel split-level relaxation

Thomas C. Henderson, Ashok Samal

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

Abstract

The split-level relaxation technique is analyzed in a parallel processing framework. It is shown that there is much parallelism inherent in the algorithm that can be exploited. This has been confirmed by implementation of the algorithm on an actual multiprocessor. Although the results are good, the implementation can be made more efficient. The use of multiple queues instead of a centralized queue can reduce memory contention, particularly in large multiprocessors. An asynchronous implementation can also improve the performance.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Pattern Recognition
PublisherPubl by IEEE
Pages220-222
Number of pages3
ISBN (Print)0818608781
StatePublished - 1988
Externally publishedYes

Publication series

NameProceedings - International Conference on Pattern Recognition

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition

Fingerprint Dive into the research topics of 'Parallel split-level relaxation'. Together they form a unique fingerprint.

  • Cite this

    Henderson, T. C., & Samal, A. (1988). Parallel split-level relaxation. In Proceedings - International Conference on Pattern Recognition (pp. 220-222). (Proceedings - International Conference on Pattern Recognition). Publ by IEEE.