Analytical modeling of a parallel branch-and-bound algorithm on MIN-based multiprocessors

Myung K. Yang, Chitaranjan Das

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

Abstract

In this paper, we propose a parallel `Decomposite Best-First' search Branch-and-Bound algorithm (pdbsbb) for MIN-based multiprocessors. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial algorithm. The proposed algorithm initially decomposes a problem into several subproblems. Each processor executes the serial Best-First search to find a local feasible solution. The local solutions are broadcasted through the network to compute the final solution. The speed-up analysis considers both the computation and communication overheads. It is seen that the parallel Decomposite Best-First search algorithm performs better than other reported schemes when communication overhead is taken into consideration.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
PublisherPubl by IEEE
Pages254-257
Number of pages4
ISBN (Print)0818626720
StatePublished - Dec 1 1992
EventProceedings of the 6th International Parallel Processing Symposium - Beverly Hills, CA, USA
Duration: Mar 23 1992Mar 26 1992

Other

OtherProceedings of the 6th International Parallel Processing Symposium
CityBeverly Hills, CA, USA
Period3/23/923/26/92

Fingerprint

Communication
Statistical Models

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

Yang, M. K., & Das, C. (1992). Analytical modeling of a parallel branch-and-bound algorithm on MIN-based multiprocessors. In Proceedings of the International Conference on Parallel Processing (pp. 254-257). Publ by IEEE.
Yang, Myung K. ; Das, Chitaranjan. / Analytical modeling of a parallel branch-and-bound algorithm on MIN-based multiprocessors. Proceedings of the International Conference on Parallel Processing. Publ by IEEE, 1992. pp. 254-257
@inproceedings{466540790ac241c0ada52c35d8928d96,
title = "Analytical modeling of a parallel branch-and-bound algorithm on MIN-based multiprocessors",
abstract = "In this paper, we propose a parallel `Decomposite Best-First' search Branch-and-Bound algorithm (pdbsbb) for MIN-based multiprocessors. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial algorithm. The proposed algorithm initially decomposes a problem into several subproblems. Each processor executes the serial Best-First search to find a local feasible solution. The local solutions are broadcasted through the network to compute the final solution. The speed-up analysis considers both the computation and communication overheads. It is seen that the parallel Decomposite Best-First search algorithm performs better than other reported schemes when communication overhead is taken into consideration.",
author = "Yang, {Myung K.} and Chitaranjan Das",
year = "1992",
month = "12",
day = "1",
language = "English (US)",
isbn = "0818626720",
pages = "254--257",
booktitle = "Proceedings of the International Conference on Parallel Processing",
publisher = "Publ by IEEE",

}

Yang, MK & Das, C 1992, Analytical modeling of a parallel branch-and-bound algorithm on MIN-based multiprocessors. in Proceedings of the International Conference on Parallel Processing. Publ by IEEE, pp. 254-257, Proceedings of the 6th International Parallel Processing Symposium, Beverly Hills, CA, USA, 3/23/92.

Analytical modeling of a parallel branch-and-bound algorithm on MIN-based multiprocessors. / Yang, Myung K.; Das, Chitaranjan.

Proceedings of the International Conference on Parallel Processing. Publ by IEEE, 1992. p. 254-257.

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

TY - GEN

T1 - Analytical modeling of a parallel branch-and-bound algorithm on MIN-based multiprocessors

AU - Yang, Myung K.

AU - Das, Chitaranjan

PY - 1992/12/1

Y1 - 1992/12/1

N2 - In this paper, we propose a parallel `Decomposite Best-First' search Branch-and-Bound algorithm (pdbsbb) for MIN-based multiprocessors. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial algorithm. The proposed algorithm initially decomposes a problem into several subproblems. Each processor executes the serial Best-First search to find a local feasible solution. The local solutions are broadcasted through the network to compute the final solution. The speed-up analysis considers both the computation and communication overheads. It is seen that the parallel Decomposite Best-First search algorithm performs better than other reported schemes when communication overhead is taken into consideration.

AB - In this paper, we propose a parallel `Decomposite Best-First' search Branch-and-Bound algorithm (pdbsbb) for MIN-based multiprocessors. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial algorithm. The proposed algorithm initially decomposes a problem into several subproblems. Each processor executes the serial Best-First search to find a local feasible solution. The local solutions are broadcasted through the network to compute the final solution. The speed-up analysis considers both the computation and communication overheads. It is seen that the parallel Decomposite Best-First search algorithm performs better than other reported schemes when communication overhead is taken into consideration.

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

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

M3 - Conference contribution

AN - SCOPUS:0026989980

SN - 0818626720

SP - 254

EP - 257

BT - Proceedings of the International Conference on Parallel Processing

PB - Publ by IEEE

ER -

Yang MK, Das C. Analytical modeling of a parallel branch-and-bound algorithm on MIN-based multiprocessors. In Proceedings of the International Conference on Parallel Processing. Publ by IEEE. 1992. p. 254-257