论文信息 - A parallel branch-and-bound algorithm for MIN-based multiprocessors

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

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.

Chita R. Das | Myung K. Yang | C. Das | Myung-Kook Yang

[1] Sartaj Sahni,et al. Anomalies in Parallel Branch-and-Bound Algorithms , 1984 .

[2] Benjamin W. Wah,et al. MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems , 1984, IEEE Transactions on Computers.