Algorithmic skeletons: structured management of parallel computation
Algorithmic skeletons: structured management of parallel computation
Recent progress in unconstrained nonlinear optimization without derivatives
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
Load Balancing in Parallel Computers: Theory and Practice
Load Balancing in Parallel Computers: Theory and Practice
From desgign patterns to parallel architectural skeletons
Journal of Parallel and Distributed Computing
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Views on template-based parallel programming
CASCON '96 Proceedings of the 1996 conference of the Centre for Advanced Studies on Collaborative research
Revisiting Asynchronous Parallel Pattern Search for Nonlinear Optimization
SIAM Journal on Optimization
A parallel distributed algorithm for the permutation flow shop scheduling problem
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
| Hi-index | 0.00 |
A new derivative-free global optimization algorithm is proposed for solving nonlinear global optimization problems. It is based on the Branch and Bound (BnB) algorithm. BnB is a general algorithm to solve optimization problems. Its implementation is done by using the developed template library of BnB algorithms. The robustness of the new algorithm is demonstrated by solving a selection of test problems. We present a short description of our template implementation of the BnB algorithm. A paradigm of domain decomposition (data parallelization) is used to construct a parallel BnB algorithm. MPI is used for underlying communications. To obtain a better load balancing, the BnB template has a load balancing module that allows the redistribution of a search space among the processors at a run time. A parallel version of the user's algorithm is obtained automatically from a sequential algorithm.