.png){kind=icon}
.png){kind=icon}
Return
Adaptive fail-safe topology optimization using a hierarchical parallelization scheme
.png){kind=icon}
OA
AI
DOI：10.1016/j.compstruc.2023.107205.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This work presents an efficient, flexible, and scalable strategy to implement density-based topology optimization formulation for fail-safe structural design. Such optimized designs can operate after faults modeled as loss of stiffness. However, the need for assessing the physical behavior in all the fault cases can make this problem unfeasible computationally. We combine many ingredients to exploit the different levels of parallelism of the formulation to deal successfully with this problem. We use a non-overlapping domain decomposition method to solve the failure cases using multi-core computing with distributed memory computation. These subdomains use adaptive mesh refinement (AMR) techniques to focus computing efforts on the regions of interest. A key point to evaluate the fault cases is the organization of the computing threads, especially in clusters of computers. We group the computing threads by physical computing nodes to reduce the inter-node communications, maximizing intra-node communications to mitigate bandwidth problems. Another ingredient of paramount importance is the use of computing buffers to adapt the evaluation of the fault cases to the computing resources. We test the scalability of the computational framework using a large cluster of computers.
Keywords:
Topology optimization
Structural redundancy
Fail-safe design
Adaptivity
Multigrid methods
High performance computing
Journal
C
IF:
4.8
Papers:
6.2K
Citations:
1.7W