Parallel interval-Newton using message passing dynamic load balancing strategies

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the 2001 ACM/IEEE Conference on Supercomputing S. 23
Hauptverfasser: Gau, Chao-Yang, Stadtherr, Mark A.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: New York, NY, USA ACM 10.11.2001
Schriftenreihe:ACM Conferences
Schlagworte:
Computing methodologies > Artificial intelligence > Search methodologies
Computing methodologies > Artificial intelligence > Search methodologies > Discrete space search
Computing methodologies > Artificial intelligence > Search methodologies > Game tree search
Mathematics of computing > Mathematical analysis > Functional analysis > Approximation
Mathematics of computing > Mathematical analysis > Mathematical optimization
Mathematics of computing > Mathematical analysis > Nonlinear equations
Theory of computation > Design and analysis of algorithms > Approximation algorithms analysis
Theory of computation > Design and analysis of algorithms > Mathematical optimization
nonlinear equations
branch-and-bound
interval analysis
parallel computing
branch-and-prune
global optimization
ISBN:9781581132939, 158113293X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9781581132939
158113293X
DOI:10.1145/582034.582057