The Community for Technology Leaders
Green Image
<p>We propose and evaluate a parallel "decomposite best-first" search branch-and-boundalgorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilisticmodel to estimate the number of evaluated nodes for a serial best-first searchbranch-and-bound algorithm. This analysis is used in predicting the parallel algorithmspeed-up. The proposed algorithm initially decomposes a problem into N subproblems,where N is the number of processors available in a multiprocessor. Afterwards, eachprocessor executes the serial best-first search to find a local feasible solution. Localsolutions are broadcasted through the network to compute the final solution. Aconflict-free mapping scheme, known as the step-by-step spread, is used for subproblemdistribution on the MIN. A speedup expression for the parallel algorithm is then derivedusing the serial best-first search node evaluation model. Our analysis considers bothcomputation and communication overheads for providing realistic speed-up.Communication modeling is also extended for the parallel global best-first searchtechnique. All the analytical results are validated via simulation. For large systems, whencommunication overhead is taken into consideration, it is observed that the paralleldecomposite best-first search algorithm provides better speed-up compared to otherreported schemes.</p>
Index Termsmultiprocessor interconnection networks; multiprocessing systems; parallel algorithms;performance evaluation; parallel branch-and-bound algorithm; MIN-based multiprocessorsystems; probabilistic model; serial best-first search; conflict-free mapping scheme;communication overheads; computation overheads

M. Yang and C. Das, "Evaluation of a Parallel Branch-and-Bound Algorithm on a Class of Multiprocessors," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 74-86, 1994.
87 ms
(Ver 3.3 (11022016))