A two-level parallel direct search implementation for arbitrarily sized objective functions
- Sandia National Labs., Albuquerque, NM (United States); and others
In the past, many optimization schemes for massively parallel computers have attempted to achieve parallel efficiency using one of two methods. In the case of large and expensive objective function calculations, the optimization itself may be run in serial and the objective function calculations parallelized. In contrast, if the objective function calculations are relatively inexpensive and can be performed on a single processor, then the actual optimization routine itself may be parallelized. In this paper, a scheme based upon the Parallel Direct Search (PDS) technique is presented which allows the objective function calculations to be done on an arbitrarily large number (p{sub 2}) of processors. If, p, the number of processors available, is greater than or equal to 2p{sub 2} then the optimization may be parallelized as well. This allows for efficient use of computational resources since the objective function calculations can be performed on the number of processors that allow for peak parallel efficiency and then further speedup may be achieved by parallelizing the optimization. Results are presented for an optimization problem which involves the solution of a PDE using a finite-element algorithm as part of the objective function calculation. The optimum number of processors for the finite-element calculations is less than p/2. Thus, the PDS method is also parallelized. Performance comparisons are given for a nCUBE 2 implementation.
- Research Organization:
- Front Range Scientific Computations, Inc., Boulder, CO (United States); USDOE, Washington, DC (United States); National Science Foundation, Washington, DC (United States)
- DOE Contract Number:
- AC04-76DP00789
- OSTI ID:
- 223838
- Report Number(s):
- CONF-9404305--Vol.1; ON: DE96005735
- Country of Publication:
- United States
- Language:
- English
Similar Records
A parallel formulation of interior point algorithms
Utilizing multidimensional loop parallelism on large-scale parallel processor systems