Implementing branch-and-bound in a ring of processors
Proc. of the conference on algorithms and hardware for parallel processing on CONPAR 86
DIB—a distributed implementation of backtracking
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel depth first search. Part I. implementation
International Journal of Parallel Programming
Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Analysis and Implementation of Branch-and-Bound Algorithms on a Hypercube Multicomputer
IEEE Transactions on Computers
Advances in parallel algorithms
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Using MPI: portable parallel programming with the message-passing interface
Using MPI: portable parallel programming with the message-passing interface
A Competitive Analysis of Load Balancing Strategiesfor Parallel Ray Tracing
The Journal of Supercomputing
A parallel approximation scheme for the multiprocessor scheduling problem
Parallel Computing - High performance computing in operations research
Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
Using MPI-2: Advanced Features of the Message Passing Interface
Using MPI-2: Advanced Features of the Message Passing Interface
Load Balancing in a Network of Transputers
Proceedings of the 2nd International Workshop on Distributed Algorithms
Two Strategies for Solving the Vertex Cover Problem on a Transputer Network
Proceedings of the 3rd International Workshop on Distributed Algorithms
Parallel best-first branch-and-bound in discrete optimization: a framework
Solving Combinatorial Optimization Problems in Parallel - Methods and Techniques
Global optimization of nonconvex nonlinear programs using parallel branch and bound
Global optimization of nonconvex nonlinear programs using parallel branch and bound
Scheduling multithreaded computations by work stealing
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Analyzing Fuzzy Surface Modeling Using Load-Balanced Computation
Computing in Science and Engineering
On efficiency of tightening bounds in interval global optimization
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
| Hi-index | 0.00 |
Branch-and-prune (BP) and branch-and-bound (BB) techniques are commonly used for intelligent search in finding all solutions, or the optimal solution, within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel computing technology. Of special interest here are techniques derived from interval analysis, in particular an interval-Newton/generalized-bisection procedure. In this context, we discuss issues of load balancing and work scheduling that arise in the implementation of parallel BB and BP, and describe and analyze techniques for this purpose. These techniques are applied to solve problems appearing in chemical process engineering using a distributed parallel computing system. Results show that a consistently high efficiency can be achieved in solving nonlinear equations, providing excellent scalability. The effectiveness of the approach used is also demonstrated in the consistent superlinear speedup observed in performing global optimization.