Concurrent Subspace Optimization Using Design Variable Sharing in a Distributed Computing Environment

Author(s):  
Brett A. Wujek ◽  
John E. Renaud ◽  
Stephen M. Batill ◽  
Jay B. Brockman

Abstract This paper reviews recent implementation advances and modifications in the continued development of a Concurrent Subspace Optimization (CSSO) algorithm for Multidisciplinary Design Optimization (MDO). The CSSO-MDO algorithm implemented in this research incorporates a Coordination Procedure of System Approximation (CP-SA) for design updates. Implementation studies detail the use of a new discipline based decomposition strategy which provides for design variable sharing across discipline design regimes (i.e., subspaces). The algorithm is implemented in a distributed computing environment, providing for concurrent discipline design. Implementation studies introduce a new multidisciplinary design test problem, the optimal design of a high performance, low cost structural system. A graphical user interface is developed which provides for menu driven execution and results display; this new programming environment highlights the modularity of the algorithm. Significant time savings are observed when using distributed computing for concurrent design across disciplines. The use of design variable sharing across disciplines does not introduce any difficulties in implementation as the design update in the CSSO-MDO algorithm is generated in the coordination procedure of system approximation (CP-SA).

2018 ◽  
Vol 7 (2) ◽  
pp. 70-74
Author(s):  
Dhruv Chander Pant ◽  
O. P. Gupta

The main challenges bioinformatics applications facing today are to manage, analyze and process a huge volume of genome data. This type of analysis and processing is very difficult using general purpose computer systems. So the need of distributed computing, cloud computing and high performance computing in bioinformatics applications arises. Now distributed computers, cloud computers and multi-core processors are available at very low cost to deal with bulk amount of genome data. Along with these technological developments in distributed computing, many efforts are being done by the scientists and bioinformaticians to parallelize and implement the algorithms to take the maximum advantage of the additional computational power. In this paper a few bioinformatics algorithms have been discussed. The parallelized implementations of these algorithms have been explained. The performance of these parallelized algorithms has been also analyzed. It has been also observed that in parallel implementations of the various bioinformatics algorithms, impact of communication subsystems with respect to the job sizes should also be analyzed.


Author(s):  
Srinivas Kodiyalam ◽  
Jaroslaw Sobieszczanski-Sobieski

Abstract The focus of this paper on investigation of alternate methods for sampling the design space for use with MDO solutions in a multi-processor, high performance computing environment. The primary aim of these methods is to maximize the information gathered about the design space of interest. The conceptual simplicity of the MDO approach described in this paper is paid for by the large computing labor in the sampling. That labor is effectively compressed in time by the HPC environment that operates a large number of processors concurrently.


Sign in / Sign up

Export Citation Format

Share Document