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 - Dec 1 1988

Publication series

NameProceedings - International Conference on Pattern Recognition

Fingerprint

Data storage equipment
Processing

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition

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.

Parallel split-level relaxation. / Henderson, Thomas C.; Samal, Ashok.

Proceedings - International Conference on Pattern Recognition. Publ by IEEE, 1988. p. 220-222 (Proceedings - International Conference on Pattern Recognition).

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

Henderson, TC & Samal, A 1988, Parallel split-level relaxation. in Proceedings - International Conference on Pattern Recognition. Proceedings - International Conference on Pattern Recognition, Publ by IEEE, pp. 220-222.
Henderson TC, Samal A. Parallel split-level relaxation. In Proceedings - International Conference on Pattern Recognition. Publ by IEEE. 1988. p. 220-222. (Proceedings - International Conference on Pattern Recognition).
Henderson, Thomas C. ; Samal, Ashok. / Parallel split-level relaxation. Proceedings - International Conference on Pattern Recognition. Publ by IEEE, 1988. pp. 220-222 (Proceedings - International Conference on Pattern Recognition).
@inproceedings{76c511cd45d9431bb48f349801bfad23,
title = "Parallel split-level relaxation",
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.",
author = "Henderson, {Thomas C.} and Ashok Samal",
year = "1988",
month = "12",
day = "1",
language = "English (US)",
isbn = "0818608781",
series = "Proceedings - International Conference on Pattern Recognition",
publisher = "Publ by IEEE",
pages = "220--222",
booktitle = "Proceedings - International Conference on Pattern Recognition",

}

TY - GEN

T1 - Parallel split-level relaxation

AU - Henderson, Thomas C.

AU - Samal, Ashok

PY - 1988/12/1

Y1 - 1988/12/1

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

AN - SCOPUS:0024174548

SN - 0818608781

T3 - Proceedings - International Conference on Pattern Recognition

SP - 220

EP - 222

BT - Proceedings - International Conference on Pattern Recognition

PB - Publ by IEEE

ER -