The Community for Technology Leaders
SC Conference (2001)
Denver, Colorado
Nov. 10, 2001 to Nov. 16, 2001
ISBN: 1-58113-293-X
pp: 23
Chao-Yang Gau , University of Notre Dame
Mark A. Stadtherr , University of Notre Dame
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 non-linear 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.
Parallel Computing, Nonlinear Equations, Global Optimization, Branch-and-Prune, Branch-and- Bound, Interval Analysis
Chao-Yang Gau, Mark A. Stadtherr, "Parallel Interval-Newton Using Message Passing: Dynamic Load Balancing Strategies", SC Conference, vol. 00, no. , pp. 23, 2001, doi:10.1109/SC.2001.10028
88 ms
(Ver 3.3 (11022016))