9,932 research outputs found
Observations on computational methodologies for use in large-scale, gradient-based, multidisciplinary design incorporating advanced CFD codes
How a combination of various computational methodologies could reduce the enormous computational costs envisioned in using advanced CFD codes in gradient based optimized multidisciplinary design (MdD) procedures is briefly outlined. Implications of these MdD requirements upon advanced CFD codes are somewhat different than those imposed by a single discipline design. A means for satisfying these MdD requirements for gradient information is presented which appear to permit: (1) some leeway in the CFD solution algorithms which can be used; (2) an extension to 3-D problems; and (3) straightforward use of other computational methodologies. Many of these observations have previously been discussed as possibilities for doing parts of the problem more efficiently; the contribution here is observing how they fit together in a mutually beneficial way
An extensive English language bibliography on graph theory and its applications, supplement 1
Graph theory and its applications - bibliography, supplement
Design and optimization of a portable LQCD Monte Carlo code using OpenACC
The present panorama of HPC architectures is extremely heterogeneous, ranging
from traditional multi-core CPU processors, supporting a wide class of
applications but delivering moderate computing performance, to many-core GPUs,
exploiting aggressive data-parallelism and delivering higher performances for
streaming computing applications. In this scenario, code portability (and
performance portability) become necessary for easy maintainability of
applications; this is very relevant in scientific computing where code changes
are very frequent, making it tedious and prone to error to keep different code
versions aligned. In this work we present the design and optimization of a
state-of-the-art production-level LQCD Monte Carlo application, using the
directive-based OpenACC programming model. OpenACC abstracts parallel
programming to a descriptive level, relieving programmers from specifying how
codes should be mapped onto the target architecture. We describe the
implementation of a code fully written in OpenACC, and show that we are able to
target several different architectures, including state-of-the-art traditional
CPUs and GPUs, with the same code. We also measure performance, evaluating the
computing efficiency of our OpenACC code on several architectures, comparing
with GPU-specific implementations and showing that a good level of
performance-portability can be reached.Comment: 26 pages, 2 png figures, preprint of an article submitted for
consideration in International Journal of Modern Physics
A new generation 99 line Matlab code for compliance Topology Optimization and its extension to 3D
Compact and efficient Matlab implementations of compliance Topology
Optimization (TO) for 2D and 3D continua are given, consisting of 99 and 125
lines respectively. On discretizations ranging from to
elements, the 2D version, named top99neo, shows speedups from
2.55 to 5.5 times compared to the well-known top88 code (Andreassen-etal 2011).
The 3D version, named top3D125, is the most compact and efficient Matlab
implementation for 3D TO to date, showing a speedup of 1.9 times compared to
the code of Amir-etal 2014, on a discretization with elements.
For both codes, improvements are due to much more efficient procedures for the
assembly and implementation of filters and shortcuts in the design update step.
The use of an acceleration strategy, yielding major cuts in the overall
computational time, is also discussed, stressing its easy integration within
the basic codes.Comment: 17 pages, 8 Figures, 4 Table
- …