Optimal structure screening for large-scale multi-state series-parallel systems based on structure ordinal optimization

2020 ◽  
pp. 1-13
Author(s):  
Yishuang Hu ◽  
Yi Ding ◽  
Yu Lin ◽  
Ming J. Zuo ◽  
Donglian Qi
Author(s):  
Yishuang Hu ◽  
Yi Ding ◽  
Zhiguo Zeng

Multi-state series-parallel systems (MSSPSs) are widely-used for representing engineering systems. In real-life cases, engineers need to design an optimal MSSPS structure by combining different versions and number of redundant components. The objective of the design is to ensure reliability requirements using the least costs, which could be formulated as a redundancy optimization problem under reliability constraints. The genetic algorithm is one of the most frequently used method for solving redundancy optimization problems. In traditional genetic algorithms, the population size needs to be determined based on the experience of the modeler. Often, this ends up creating a large number of unnecessary samples. As a result, the computational burden can be huge, especially for large-scale MSSPS structures. To solve these problems, this paper proposes an optimal structure designing method named as redundancy ordinal optimization. The universal generating function technique is applied to evaluate the reliabilities of the MSSPSs. Based on the reliabilities, an ordinal optimization algorithm is adapted to update the parent populations and the stopping criterion of genetic algorithm, so that the unnecessary structure designs can be eliminated. Numerical examples show that the proposed method improves the computational efficiency while remaining satisfactorily accurate.


Author(s):  
Chao Yang ◽  
Padma Raghavan ◽  
Lloyd Arrowood ◽  
Donald W. Noid ◽  
Bobby G. Sumpter ◽  
...  

Summary A parallel computational scheme for analyzing large-scale molecular vibration on distributed memory computing platforms is presented in this paper. This method combines the implicitly restarted Lanczos algorithm with a state-of-art parallel sparse direct solver to compute a set of low frequency vibrational modes for molecular systems containing tens of thousands of atoms. Although the original motivation for developing such a scheme was to overcome memory limitations on traditional sequential and shared memory machines, our computational experiments show that with a careful parallel design and data partitioning scheme one can achieve scalable performance on lightly coupled distributed memory parallel systems. In particular, we demonstrate performance enhancement achieved by using the latency tolerant “selective inversion” scheme in the sparse triangular substitution phase of the computation.


2011 ◽  
Vol 21 (03) ◽  
pp. 301-318
Author(s):  
DARREN J. KERBYSON ◽  
KEVIN J. BARKER

Direct Numerical Simulation (DNS) is an important application area that is expected to use large fractions of future large-scale simulations. In this work we develop, validate and use a performance model of the combustion code, DNS3D, to explore achieved performance on current parallel systems. The performance model is developed from a thorough analysis of the application. Its key computation characteristics are coupled with the performance characteristics of the system using an parameterized analytical model. The model is validated on three parallel systems: a muti-core AMD Opteron based system with an Infiniband fat-tree network, an IBM Power5+ system with an HPS fat-tree network, and an IBM Power7 system with a direct connect network. The performance model is shown to achieve high prediction accuracy on all three systems. We illustrate how the model can be used to explore impact of changes in either the system or the application. It is used to both analyze the achieved performance on these systems as well as to explore the possible benefits of further optimizing DNS3D's main computational kernel of one-dimensional FFTs, or in possibly overlapping communication with computation.


Sign in / Sign up

Export Citation Format

Share Document