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

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Analytical modeling of a parallel branch-and-bound algorithm on MIN-based multiprocessors'. Together they form a unique fingerprint.

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