SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
The purpose of the ROSE Complier Framework Is to automate source code porting, source and binary code analysis, and source code translations such as platform optimization, binary code analysis, Identification of source code and binary code vulnerablllttes.
The Ducted Assembly Steady-State Heat transfer code (DASSH) performs full-core subchannel thermal hydraulics calculations in liquid metal fast reactors. One of the applications of subchannel codes is to optimize coolant flow orificing. As a design activity, the primary task is to determine the best way to divide assemblies into groups and distribute coolant flow rates among them. This report documents an algorithm implemented in DASSH to automatically optimize coolant orificing. Over the course of multiple iterations, DASSH determines the orifice grouping and flow distribution that minimizes peak coolant, clad, or fuel temperatures across all timesteps for a user-specified number of assembly groups. The total coolant flow rate in the reactor is constrained to achieve the specified core-average outlet temperature. The flow rate to each orifice group may also be constrained by the allowable pressure drop. The distribution of coolant flow among groups is accelerated using a predictor-corrector algorithm based on interpolated results from single-assembly parametric calculations. The assembly orificing grouping is initially predicted based on assembly power but can be refined if results demonstrate that an assembly would fit better in another group. The algorithm is demonstrated with two case studies. The first is a simple model for a reactor core consisting of just fuel assemblies; the pin power distributions are specified to create a situation where the initial assembly grouping prediction is suboptimal. This example is used to describe the initial grouping, demonstrate convergence over multiple iterations, and highlight the impact of regrouping. Then, the algorithm is applied to minimize peak clad and fuel temperatures in an example sodium-cooled fast reactor, the Versatile Test Reactor. The multicycle optimization confirms prior calculations for the reference core design. The example highlights how optimizing for different peak temperatures affects the results and demonstrates the use of the pressure drop constraint to limit the maximum flow rate.
A tool for the calculation of optimal three-dimensional (3D) perturbative magnetic fields in tokamaks has been developed. The IPECOPT code builds upon the stellarator optimization code STELLOPT to allow for optimization of linear ideal magnetohydrodynamic perturbed equilibrium (IPEC). This tool has been applied to NSTX-U equilibria, addressing which fields are the most effective at driving NTV torques. The NTV torque calculation is performed by the PENT code. Optimization of the normal field spectrum shows that fields with n = 1 character can drive a large core torque. It is also shown that fields with n = 3 features are capable of driving edge torque and some core torque. Coil current optimization (using the planned in-vessel and existing RWM coils) on NSTX-U suggest the planned coils set is adequate for core and edge torque control. In conclusion, comparison between error field correction experiments on DIII-D and the optimizer show good agreement.
In this work a new computer code, BWROPT (Boiling Water Reactor Optimization), is presented. BWROPT uses the Parallel Simulated Annealing (PSA) algorithm to solve the out-of-core optimization problem coupled with an in-core optimization that determines the optimum fuel loading pattern. However it uses a Haling power profile for the depletion instead of optimizing the operating strategy. The result of this optimization is the optimum new fuel inventory and the core loading pattern for the first cycle considered in the optimization. Several changes were made to the optimization algorithm with respect to other nuclear fuel cycle optimization codes that use PSA. Instead of using constant sampling probabilities for the solution perturbation types throughout the optimization as is usually done in PSA optimizations the sampling probabilities are varied to get a better solution and/or decrease runtime. The new fuel types available for use can be sorted into an array based on any number of parameters so that each parameter can be incremented or decremented, which allows for more precise fuel type selection compared to random sampling. Also, the results are sorted by the new fuel inventory of the first cycle for ease of comparing alternative solutions. (authors)
Based on the acoustic radiation of point source, the physical mechanism of phase-coded acoustical vortices is investigated with formulae derivations of acoustic pressure and vibration velocity. Various factors that affect the optimization of acoustical vortices are analyzed. Numerical simulations of the axial, radial, and circular pressure distributions are performed with different source numbers, frequencies, and axial distances. The results prove that the acoustic pressure of acoustical vortices is linearly proportional to the source number, and lower fluctuations of circular pressure distributions can be produced for more sources. With the increase of source frequency, the acoustic pressure of acoustical vortices increases accordingly with decreased vortex radius. Meanwhile, increased vortex radius with reduced acoustic pressure is also achieved for longer axial distance. With the 6-source experimental system, circular and radial pressure distributions at various frequencies and axial distances have been measured, which have good agreements with the results of numerical simulations. The favorable results of acoustic pressure distributions provide theoretical basis for further studies of acoustical vortices.
There is growing evidence regarding the importance of spike timing in neural information processing, with even a small number of spikes carrying information, but computational models lag significantly behind those for rate coding. Experimental evidence on neuronal behavior is consistent with the dynamical and state dependent behavior provided by recurrent connections. This motivates the minimalistic abstraction investigated in this paper, aimed at providing insight into information encoding in spike timing via recurrent connections. We employ information-theoretic techniques for a simple reservoir model which encodes input spatiotemporal patterns into a sparse neural code, translating the polychronous groups introduced by Izhike-vich into codewords on which we can perform standard vector operations. Finally, we show that the distance properties of the code are similar to those for (optimal) random codes. In particular, the code meets benchmarks associated with both linear classification and capacity, with the latter scaling exponentially with reservoir size.
We present results of a performance study of an astrophysical radiation hydrodynamics code, V2D, on the Arm-based A64FX processor developed by Fujitsu. The code solves sparse linear systems, a task for which the A64FX architecture should be well suited. Here, we performed the performance analysis study on Ookami, an Apollo 80 platform utilizing the A64FX processor. We explored several compilers and performance anal-ysis packages and found the code did not perform as expected under scalable vector extension optimization, suggesting that a “deeper dive” into analyzing the code is worthwhile. However, a simple driver program that exercised basic sparse linear algebra routines used by V2D did show significant speedup with the use of the scalable vector extension optimization. We present the initial results from the study which used V2D on a relatively simple test problem that emphasized the repeated solution of sparse linear systems.
In coded aperture imaging, one of the most important factors determining the quality of reconstructed images is the choice of mask/aperture pattern. In many applications, uniformly redundant arrays (URAs) are widely accepted as the optimal mask pattern. Under ideal conditions, thin and highly opaque masks, URA patterns are mathematically constructed to provide artifact-free reconstruction however, the number of URAs for a chosen number of mask elements is limited and when highly penetrating particles such as fast neutrons and high-energy gamma-rays are being imaged, the optimum is seldom achieved. In this case more robust mask patterns that provide better reconstructed image quality may exist. Through the use of heuristic optimization methods and maximum likelihood expectation maximization (MLEM) image reconstruction, we show that for both point and extended neutron sources a random mask pattern can be optimized to provide better image quality than that of a URA.
The purpose of this paper is to introduce the multi-solution nature of topology optimization (TO) as a design tool for additive manufacturing (AM). The sensitivity of topologically optimized parts and manufacturing constraints to the initial starting point of the optimization process leading to structures with equivalent performance is explored. A modified bi-directional evolutionary structural optimization (BESO) code was used as the numerical approach to optimize a cantilever beam problem and reduce the mass by 50 per cent. Several optimized structures with relatively equivalent mechanical performance were generated by changing the initial starting point of the TO algorithm. These optimized structures were manufactured using fused deposition modeling (FDM). The equivalence of strain distribution in FDM parts was tested with the digital image correlation (DIC) technique and compared with that from the modified BESO code.The results confirm that TO could lead to a wide variety of non-unique solutions based on loading and manufacturability constraints. The modified BESO code was able to reduce the support structure needed to build the simple two-dimensional cantilever beam by 15 per cent while keeping the mechanical performance at the same level. Finally, the originality of this paper lies in introduction and application of the multi-solution nature of TO for AM as a design tool for optimizing structures with minimized features in the overhang condition and the need for support structures.
This code performs an optimization over the structure of a porous electrode formed from a lattice of unit cells. This is a steepest descent version of the code used in: V. A. Beck, J. J. Wong, C. F. Jekel, D. A. Tortorelli, S. E. Baker, E. B. Duoss and M. A. Worsley, Computational design of microarchitected porous electrodes for redox flow batteries, J. Power Sources, 2021, 512, 230453.
Thread-parallelization and single-instruction multiple data (SIMD) ”vectorisation” of software components in HEP computing has become a necessity to fully benefit from current and future computing hardware. In this context, the Geant-Vector/GPU simulation project aims to re-engineer current software for the simulation of the passage of particles through detectors in order to increase the overall event throughput. As one of the core modules in this area, the geometry library plays a central role and vectorising its algorithms will be one of the cornerstones towards achieving good CPU performance. Here, we report on the progress made in vectorising the shape primitives, as well as in applying new C++ template based optimizations of existing code available in the Geant4, ROOT or USolids geometry libraries. We will focus on a presentation of our software development approach that aims to provide optimized code for all use cases of the library (e.g., single particle and many-particle APIs) and to support different architectures (CPU and GPU) while keeping the code base small, manageable and maintainable. We report on a generic and templated C++ geometry library as a continuation of the AIDA USolids project. As a result, the experience gained with these developments will be beneficial to other parts of the simulation software, such as for the optimization of the physics library, and possibly to other parts of the experiment software stack, such as reconstruction and analysis.
Abstract As the Ion Cyclotron Radio Frequency range (ICRF) heating becomes more favorable in fusion devices, the urgency of predicting and mitigating impurity generation that arises from it becomes more pressing. In the ICRF regime, rectified Radio Frequency (RF) sheaths are known to form at antenna and material edges that influence negative effects like sputtering and a decrease in heating efficiency. Methods to mitigate the formation of these RF sheaths through RF image currents cancellation have been experimentally studied. A power-phasing scan done on Alcator C-Mod in which the amount of power on the two inner straps ( P in ) versus the total 4 straps ( P tot ) was varied showed a minimization of enhanced potentials between P in / P tot ∼ 0.7–0.9 while impurities were minimized for P in / P tot ∼ 0.5–0.8. New capabilities in the realm of representing the RF sheath numerically now allow for these experiments to be simulated. Given the size of the sheath relative to the scale of the device, it can be approximated as a Boundary Condition (BC). A new parallelized cold-plasma wave equation solver called Stix implements a non-linear sheath impedance model BC formulated by Myra et al (2015 Phys. Plasmas 22 062507) through the method of finite elements using the MFEM library [ http://mfem.org ]. It is seen that Stix shows qualitative agreement with the measured C-Mod enhanced potentials.
A plurality of columns for a check matrix that implements a distance d linear error correcting code are populated by providing a set of vectors from which to populate the columns, and applying to the set of vectors a filter operation that reduces the set by eliminating therefrom all vectors that would, if used to populate the columns, prevent the check matrix from satisfying a column-wise linear independence requirement associated with check matrices of distance d linear codes. One of the vectors from the reduced set may then be selected to populate one of the columns. The filtering and selecting repeats iteratively until either all of the columns are populated or the number of currently unpopulated columns exceeds the number of vectors in the reduced set. Columns for the check matrix may be processed to reduce the amount of logic needed to implement the check matrix in circuit logic.
A plurality of columns for a check matrix that implements a distance d linear error correcting code are populated by providing a set of vectors from which to populate the columns, and applying to the set of vectors a filter operation that reduces the set by eliminating therefrom all vectors that would, if used to populate the columns, prevent the check matrix from satisfying a column-wise linear independence requirement associated with check matrices of distance d linear codes. One of the vectors from the reduced set may then be selected to populate one of the columns. The filtering and selecting repeats iteratively until either all of the columns are populated or the number of currently unpopulated columns exceeds the number of vectors in the reduced set. Columns for the check matrix may be processed to reduce the amount of logic needed to implement the check matrix in circuit logic.
A plurality of columns for a check matrix that implements a distance d linear error correcting code are populated by providing a set of vectors from which to populate the columns, and applying to the set of vectors a filter operation that reduces the set by eliminating therefrom all vectors that would, if used to populate the columns, prevent the check matrix from satisfying a column-wise linear independence requirement associated with check matrices of distance d linear codes. One of the vectors from the reduced set may then be selected to populate one of the columns. The filtering and selecting repeats iteratively until either all of the columns are populated or the number of currently unpopulated columns exceeds the number of vectors in the reduced set. Columns for the check matrix may be processed to reduce the amount of logic needed to implement the check matrix in circuit logic.
Scientific computing is dominated by team-authored legacy code that has evolved over decades with the purpose of capturing the evolving understanding of a scientific discipline. Accumulated deprecated code, various optimization techniques, and evolving algorithms lead to convoluted source code that is impractical to reverse engineer using mainstream methods. This prevents codes from being truly repeatable or understandable, which are two of the most essential needs in scientific computing. We refactored a long-standing implementation of a common biosequence alignment algorithm in an effort to reproduce its salient behaviors in usable form. Because of the sheer size and complexity of this code base, we developed custom tools to visualize and manipulate the source code behavior under a variety of conditions. We present a case study of extracting and refactoring the algorithmic core and a novel process of discovery/prototyping/testing using a combination of openly available and custom-built tools. The result is a reduction in code size of over 2 orders of magnitude while reconstructing the key protein alignment function in BLAST
Dynamic aperture (DA) optimization with direct particle tracking is a straight forward approach when the computing power is permitted. It can have various realistic errors included and is more close than theoretical estimations. In this approach, a fast and parallel tracking code could be very helpful. In this presentation, we describe an implementation of storage ring particle tracking code TESLA for beam dynamics optimization. It supports MPI based parallel computing and is robust as DA calculation engine. This code has been used in the NSLS-II dynamics optimizations and obtained promising performance.
We present a new compiler framework for truly heterogeneous 3D stencil computation on GPU clusters. Our framework consists of a simple directive-based programming model and a tightly integrated source-to-source compiler. Annotated with a small number of directives, sequential stencil C codes can be automatically parallelized for large-scale GPU clusters. The most distinctive feature of the compiler is its capability to generate hybrid MPI$+$ CUDA$+$ OpenMP code that uses concurrent CPU$+$ GPU computing to unleash the full potential of powerful GPU clusters. The auto-generated hybrid codes hide the overhead of various data motion by overlapping them with computation. Test results on the Titan supercomputer and the Wilkes cluster show that auto-translated codes can achieve about 90 % of the performance of highly optimized handwritten codes, for both a simple stencil benchmark and a real-world application in cardiac modeling. The user-friendliness and performance of our domain-specific compiler framework allow harnessing the full power of GPU-accelerated supercomputing without painstaking coding effort.