Performance Modeling and Analysis of a Massively Parallel Direct—Part 1

Modeling and analysis techniques are used to investigate the performance of a massively parallel version of DIRECT, a global search algorithm widely used in multidisciplinary design optimization applications. Several high-dimensional benchmark functions and real world problems are used to test the design effectiveness under various problem structures. Theoretical and experimental results are compared for two parallel clusters with different system scales and network connectivities. The present work aims at studying the performance sensitivity to important parameters for problem configurations, parallel schemes, and system settings. The performance metrics include the memory usage, load balancing, parallel efficiency, and scalability. An analytical bounding model is constructed to measure the load balancing performance under different schemes. Additionally, linear regression models are used to characterize two major overhead sources, interprocessor communication and processor idleness, and also applied to the isoefficiency functions in scalability analysis. For a variety of high-dimensional problems and large-scale systems, the massively parallel design has achieved reasonable performance. The results of the performance study provide guidance for efficient problem and scheme configuration. More importantly, the generalized design considerations and analysis techniques are beneficial for transforming many global search algorithms into effective large-scale parallel optimization tools.

[1]  Clifford A. Shaffer,et al.  Hierarchical parallel scheme for global parameter estimation in systems biology , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[2]  Simon P. Wilson,et al.  Global optimization approaches to an aircraft routing problem , 2003, Eur. J. Oper. Res..

[3]  Sverker Holmgren,et al.  Simultaneous search for multiple QTL using the global optimization algorithm DIRECT , 2004, Bioinform..

[4]  C. T. Kelley,et al.  A Locally-Biased form of the DIRECT Algorithm , 2001, J. Glob. Optim..

[5]  Layne T. Watson,et al.  DIRECT Algorithm with Box Penetration for Improved Local Convergence , 2002 .

[6]  Jean-Marc Geib,et al.  A parallel adaptive tabu search approach , 1998, Parallel Comput..

[7]  Layne T. Watson,et al.  A Fully Distribute Parallel Global Search Algorithm , 2001, PPSC.

[8]  C. T. Kelley,et al.  Modifications of the direct algorithm , 2001 .

[9]  Udi Manber,et al.  Introduction to algorithms - a creative approach , 1989 .

[10]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[11]  Clifford A. Shaffer,et al.  Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle , 2008, J. Glob. Optim..

[12]  C. D. Perttunen,et al.  Lipschitzian optimization without the Lipschitz constant , 1993 .

[13]  Clifford A. Shaffer,et al.  Dynamic Data Structures for a Direct Search Algorithm , 2002, Comput. Optim. Appl..

[14]  Bernard Grossman,et al.  Parallel Global Aircraft Configuration Design Space Exploration , 1999 .

[15]  P. Papalambros,et al.  A MODIFICATION TO JONES' GLOBAL OPTIMIZATION ALGORITHM FOR FAST LOCAL CONVERGENCE , 1998 .

[16]  Owen J. Eslinger,et al.  Algorithms for Noisy Problems in Gas Transmission Pipeline Optimization , 2001 .

[17]  Masha Sosonkina,et al.  Design and implementation of a massively parallel version of DIRECT , 2008, Comput. Optim. Appl..

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

[19]  Larry Carter,et al.  Scheduling strategies for master-slave tasking on heterogeneous processor platforms , 2004, IEEE Transactions on Parallel and Distributed Systems.

[20]  Kento Aida,et al.  Distributed computing with hierarchical master-worker paradigm for parallel branch and bound algorithm , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[21]  D. Finkel,et al.  Convergence analysis of the direct algorithm , 2004 .

[22]  Donald R. Jones,et al.  Direct Global Optimization Algorithm , 2009, Encyclopedia of Optimization.

[23]  Jens Viggo Clausen.  Parallel Branch and Bound — Principles and Personal Experiences , 1997 .

[24]  Layne T. Watson,et al.  A DISTRIBUTED GENETIC ALGORITHM WITH MIGRATION FOR THE DESIGN OF COMPOSITE LAMINATE STRUCTURES , 2000, Parallel Algorithms Appl..

[25]  David B. Bogy,et al.  Direct algorithm and its application to slider air bearing surface optimization , 2002 .

[26]  Clifford A. Shaffer,et al.  Globally optimal transmitter placement for indoor wireless communication systems , 2004, IEEE Transactions on Wireless Communications.

[27]  L. Watson,et al.  Globally optimised parameters for a model of mitotic control in frog egg extracts. , 2005, Systems biology.

[28]  D. Finkel,et al.  An Adaptive Restart Implementation of DIRECT , 2004 .

[29]  Thomas L. Sterling,et al.  BEOWULF: A Parallel Workstation for Scientific Computation , 1995, ICPP.

[30]  Günter Haring,et al.  Performance Bounds for Distributed Systems with Workload Variabilities and Uncertainties , 1997, Parallel Comput..

[31]  Yaroslav D. Sergeyev,et al.  Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants , 2006, SIAM J. Optim..