Journal
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION
Volume 52, Issue 5, Pages 845-859Publisher
SPRINGER
DOI: 10.1007/s00158-015-1252-x
Keywords
Topology optimization; Polygonal elements; Direct solver; Iterative solver; Parallel solver
Categories
Funding
- US National Science Foundation under grant CMMI [1321661]
- University of Illinois at Urbana-Champaign (UIUC)
- Directorate For Engineering
- Div Of Civil, Mechanical, & Manufact Inn [1321661] Funding Source: National Science Foundation
Ask authors/readers for more resources
This paper presents the PolyTop++, an efficient and modular framework for parallel structural topology optimization using polygonal meshes. It consists of a C++ and CUDA (a parallel computing model for GPUs) alternative implementations of the PolyTop code by Talischi et al. (Struct Multidiscip Optim 45(3):329-357 2012b). PolyTop++ was designed to support both CPU and GPU parallel solutions. The software takes advantage of the C++ programming language and the CUDA model to design algorithms with efficient memory management, capable of solving large-scale problems, and uses its object-oriented flexibility in order to provide a modular scheme. We describe our implementation of different solvers for the finite element analysis, including both direct and iterative solvers, and an iterative 'matrix-free' solver; these were all implemented in serial and parallel modes, including a GPU version. Finally, we present numerical results for problems with about 40 million degrees of freedom both in 2D and 3D.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available