By Topic

Analysis and implementation of branch-and-bound algorithms on a hypercube multicomputer

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
M. J. Quinn ; Dept. of Comput. Sci., New Hampshire Univ., Durham, NH, USA

The feasibility of implementing best-first (best-bound) branch-and-bound algorithms on hypercube multicomputers is discussed. The computationally-intensive nature of these algorithms might lead a causal observer to believe that their parallelization is trivial. However, as the number of processors grows, two goals must be satisfied to some degree in order to maintain a reasonable level of efficiency. First, processors must be kept busy doing productive work (i.e. exploring worthwhile subproblems). Second, the number of interprocessor communications must be minimized along the critical path in the state-space tree from the original problem to the subproblem yielding a solution. It is difficult to improve performance in one of these areas without degrading performance in the other. Analytical models for the execution time of loosely synchronous and asynchronous parallel branch-and-bound algorithms are presented, and the models are validated with data from the execution of five algorithms that solve the traveling salesperson problem

Published in:

IEEE Transactions on Computers  (Volume:39 ,  Issue: 3 )