A parallel branch-and-bound algorithm for MIN-based multiprocessors

Authors:
Myung K. Yang;Chita R. Das
Affiliations:
-;-
Venue:
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Year:
1991

Citing 1
Cited 1

Anomalies in parallel branch-and-bound algorithms

Communications of the ACM

P2P design and implementation of a parallel branch and bound algorithm for grids

International Journal of Grid and Utility Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A parallel "Decomposite Best-First" search Branch-and-Bound algorithm (pdbsbb) for MIN-based multiprocessor systems is proposed in this paper. A conflict free mapping scheme, known as step-by-step spread, is used to map the algorithm efficiently on to a MIN-based system for reducing communication overhead. It is shown that the proposed algorithm provides better speed-up than other reported schemes when communication overhead is taken into consideration.