Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
Anomalies in parallel branch-and-bound algorithms
Communications of the ACM
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
A parallelized search strategy for solving a multicriteria aircraft routing problem
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
All-To-All Broadcast and Matrix Multiplication in Faulty SIMD Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Performance analysis for parallel solutions to generic search problems
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Parallel interval-Newton using message passing: dynamic load balancing strategies
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Evaluation of a Parallel Branch-and-Bound Algorithm on a Class of Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Case Study of Load Distribution in Parallel View Frustum Culling and Collision Detection
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
VECPAR '00 Selected Papers and Invited Talks from the 4th International Conference on Vector and Parallel Processing
Cooperative search for optimizing pipeline operations
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track
Efficient parallel branch-and-bound algorithm for constructing minimum ultrametric trees
Journal of Parallel and Distributed Computing
Confidence-based work stealing in parallel constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
| Hi-index | 14.98 |
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.