Performance analysis of distributed solution approaches in simulation-based optimization

Abstract.Applying computationally expensive simulations in design or process optimization results in long-running solution processes even when using a state-of-the-art distributed algorithm and hardware. Within these simulation-based optimization problems the optimizer has to treat the simulation systems as black-boxes. The distributed solution of this kind of optimization problem demands efficient utilization of resources (i.e. processors) and evaluation of the solution quality. Analyzing the parallel performance is therefore an important task in the development of adequate distributed approaches taking into account the numerical algorithm, its implementation, and the used hardware architecture. In this paper, simulation-based optimization problems are characterized and a distributed solution algorithm is presented. Different performance analysis techniques (e.g. scalability analysis, computational complexity) are discussed and a new approach integrating parallel performance and solution quality is developed. This approach combines a priori and a posteriori techniques and can be applied in early stages of the solution process. The feasibility of the approach is demonstrated by applying it to three different classes of simulation-based optimization problems from groundwater management.

[1]  John E. Dennis,et al.  A framework for managing models in nonlinear optimization of computationally expensive functions , 1999 .

[2]  Lui Sha,et al.  What Are the Top Ten Most Influential Parallel and Distributed Processing Concepts of the Past Millenium? , 2001, J. Parallel Distributed Comput..

[3]  Ian Gorton,et al.  Performance Evaluation for Parallel Systems: A Survey , 1997 .

[4]  Ramesh Subramonian,et al.  LogP: a practical model of parallel computation , 1996, CACM.

[5]  Craig A. Tovey,et al.  Tutorial on Computational Complexity , 2002, Interfaces.

[6]  Alan H. Karp,et al.  Measuring parallel processor performance , 1990, CACM.

[7]  M. Stettner,et al.  Multidisciplinary Design Optimisation of an Aircraft Wing by Applying a Hybrid Optimisation Strategy , 2002 .

[8]  Werner Schiehlen,et al.  Co-Simulation for Mechatronic Systems , 2001 .

[9]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[10]  David E. Goldberg,et al.  SEARCH, Blackbox Optimization, And Sample Complexity , 1996, FOGA.

[11]  John E. Dennis,et al.  Problem Formulation for Multidisciplinary Optimization , 1994, SIAM J. Optim..

[12]  M. J. Box A New Method of Constrained Optimization and a Comparison With Other Methods , 1965, Comput. J..

[13]  Xenofon Koutsoukos,et al.  On hybrid control of complex systems : a survey , 1998 .

[14]  Sven Leyffer,et al.  Nonlinear programming without a penalty function , 2002, Math. Program..

[15]  Vladimir M. Veliov,et al.  On the Time-Discretization of Control Systems , 1997 .

[16]  Xian-He Sun,et al.  Scalability of Parallel Algorithm-Machine Combinations , 1994, IEEE Trans. Parallel Distributed Syst..

[17]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[18]  J. Dennis,et al.  Direct Search Methods on Parallel Machines , 1991 .

[19]  Bernd Freisleben,et al.  Distributed solution of optimal hybrid control problems on networks of workstations , 2000, Proceedings IEEE International Conference on Cluster Computing. CLUSTER 2000.

[20]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.