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
Search in Artificial Intelligence
Search in Artificial Intelligence
Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Adaptive parallel algorithms for integral knapsack problems
Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
Analysis and Implementation of Branch-and-Bound Algorithms on a Hypercube Multicomputer
IEEE Transactions on Computers
Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
Annals of Operations Research
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
Scheduling multithreaded computations by work stealing
Journal of the ACM (JACM)
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
Implementing Branch-and-Bound in a Ring of Processors
CONPAR '86 Conference on Algorithms and Hardware for Parallel Processing
Global optimization of nonconvex nonlinear programs using parallel branch and bound
Global optimization of nonconvex nonlinear programs using parallel branch and bound
Parallel interval newton method on CUDA
PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing
| Hi-index | 0.00 |
Branch-and-prune and branch-and-bound 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 interval-Newton on a cluster of workstations using message passing, and describe and analyze techniques for this purpose. Results using an asynchronous diffusive load balancing strategy show that a consistently high efficiency can be achieved in solving nonlinear equations, providing excellent scalability, especially with the use of a two-dimensional torus virtual network. The effectiveness of the approach used, especially in connection with a novel stack management scheme, is also demonstrated in the consistent superlinear speedups observed in performing global optimization.