### 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 language | English (US) |
---|---|

Title of host publication | Proceedings of the International Conference on Parallel Processing |

Publisher | Publ by IEEE |

Pages | 254-257 |

Number of pages | 4 |

ISBN (Print) | 0818626720 |

State | Published - Dec 1 1992 |

Event | Proceedings of the 6th International Parallel Processing Symposium - Beverly Hills, CA, USA Duration: Mar 23 1992 → Mar 26 1992 |

### Other

Other | Proceedings of the 6th International Parallel Processing Symposium |
---|---|

City | Beverly Hills, CA, USA |

Period | 3/23/92 → 3/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

*Proceedings of the International Conference on Parallel Processing*(pp. 254-257). Publ by IEEE.